Abstract
Having good estimates or even bounds for the error in computing approximations to expressions of the form f(A)v is very important in practical applications. In this paper we consider the case that A is Hermitian and that f is a rational function. We assume that the Lanczos method is used to compute approximations for f(A)v and we show how to obtain a posteriori upper and lower bounds on the ℓ2-norm of the approximation error. These bounds are computed by minimizing and maximizing a rational function whose coefficients depend on the iteration step. We use global optimization based on interval arithmetic to obtain these bounds and include a number of experimental results illustrating the quality of the error estimates.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Alefeld, G., Herzberger, J.: Introduction to Interval Computation. Academic Press, London (1983)
Arnold, G., Cundy, N., van den Eshof, J., Frommer, A., Krieg, S., Lippert, T., Schäfer, K.: Numerical methods for the QCD overlap operator. II: Optimal Krylov subspace methods. In: Boriçi, et al. (eds.) [4]
Baker, G.A., Graves-Morris, P.: Padé Approximants, Encyclopedia of Mathematics and its applications. Cambridge University Press, Cambridge (1996)
Boriçi, A., Frommer, A., Joó, B., Kennedy, A., Pendleton, B. (eds.): Methods of Algorithmic Language Implementation. Lecture Notes in Computational Science and Engineering, vol. 47. Springer, Berlin (2005)
Carpenter, A.J., Ruttan, A., Varga, R.S.: Extended numerical computations on the 1/9 conjecture in rational approximation theory. In: Graves-Morris, P.R., Saff, E.B., Varga, R.S. (eds.) Rational Approximation and Interpolation. Lecture Notes in Mathematics, vol. 1105, pp. 383–411. Springer, Berlin (1984)
Druskin, V., Knizhnerman, L.: Two polynomial methods of calculating functions of symmetric matrices. U.S.S.R. Comput. Math. Math. Phys. 29, 112–121 (1989)
Frommer, A., Simoncini, V.: Stopping criteria for rational matrix functions of hermitian and symmetric matrices. SIAM J. Sci. Comput. 30, 1387–1412 (2008)
Gallopoulos, E., Saad, Y.: Efficient solution of parabolic equations by Krylov approximation methods. SIAM J. Sci. Stat. Comput. 13, 1236–1264 (1992)
Grimm, V., Hochbruck, M.: Rational approximation to trigonometric operators. BIT 48, 215–229 (2008)
Hairer, E., Lubich, C., Wanner, G.: Geometric numerical integration. In: Structure-preserving algorithms for ordinary differential equations. Springer Series in Computational Mathematics, vol. 31. Springer, Berlin (2002)
Hansen, E.R., Walster, W.G.: Global Optimization Using Interval Analysis, 2nd edn. Marcel Dekker, New York (2004)
Higham, N.J.: Matrix Functions – Theory and Applications. SIAM, Philadelphia (2008)
Hochbruck, M., Lubich, C.: On Krylov subspace approximations to the matrix exponential operator. SIAM J. Numer. Anal. 34, 1911–1925 (1997)
Hochbruck, M., Ostermann, A.: Exponential Runge-Kutta methods for parabolic problems. Applied Numer. Math. 53, 323–339 (2005)
Hochbruck, M., van den Eshof, J.: Preconditioning Lanczos approximations to the matrix exponential. SIAM J. Sci. Comput. 27, 1438–1457 (2006)
Horn, R.A., Johnson, C.R.: Topics in Matrix Analysis. Cambridge University Press, Cambridge (1994)
Kearfott, R.B.: Rigorous Global Search: Continuous Problems. Kluwer Academic Publishers, Dordrecht (1996)
Lopez, L., Simoncini, V.: Analysis of projection methods for rational function approximation to the matrix exponential. SIAM J. Numer. Anal. 44, 613–635 (2006)
The MathWorks, Inc., MATLAB 7 (September 2004)
Moret, I., Novati, P.: RD-rational approximations of the matrix exponential. BIT, Numerical Mathematics 44, 595–615 (2004)
National Institute of Standards and Technology, Matrix market
Neumaier, A.: Interval Methods for Systems of Equations. Cambridge University Press, Cambridge (1990)
Paige, C.C., Parlett, B.N., van der Vorst, H.A.: Approximate solutions and eigenvalue bounds from Krylov subspaces. Numerical Linear Algebra with Applications 2, 115–134 (1995)
Petrushev, P.P., Popov, V.A.: Rational Approximation of Real Functions. Cambridge University Press, Cambridge (1987)
Popolizio, M., Simoncini, V.: Acceleration techniques for approximating the matrix exponential operator. SIAM J. Matrix Analysis and Appl. 30, 657–683 (2008)
Ratschek, H., Rokne, J.: New Computer Methods for Global Optimization. Ellis Horwood, Chichester (1988)
Rump, S.M.: INTLAB – INTerval LABoratory. In: Csendes, T. (ed.) Developments in Reliabale Computing, pp. 77–104. Kluwer, Dordrecht (1999)
Saad, Y.: Analysis of some Krylov subspace approximations to the matrix exponential operator. SIAM J. Numer. Anal. 29, 209–228 (1992)
van den Eshof, J., Frommer, A., Lippert, T., Schilling, K., van der Vorst, H.A.: Numerical methods for the QCD overlap operator. I: Sign-function and error bounds. Comput. Phys. Commun. 146, 203–224 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Frommer, A., Simoncini, V. (2009). Error Bounds for Lanczos Approximations of Rational Functions of Matrices. In: Cuyt, A., Krämer, W., Luther, W., Markstein, P. (eds) Numerical Validation in Current Hardware Architectures. Lecture Notes in Computer Science, vol 5492. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-01591-5_13
Download citation
DOI: https://doi.org/10.1007/978-3-642-01591-5_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-01590-8
Online ISBN: 978-3-642-01591-5
eBook Packages: Computer ScienceComputer Science (R0)