Stopping criteria for rational matrix functions of hermitian and symmetric matrices

SIAM Journal on Scientific Computing

Volumn 30, Issue 3, 2008, Pages 1387-1412

  Frommer, Andreas ^a   Simoncini, Valeria ^b,c  

^a UNIVERSITY OF WUPPERTAL   (Germany)

^b UNIVERSITY OF BOLOGNA   (Italy)

^c CIRSA   (Italy)

Author keywords

Arnoldi method; CG iteration; Error bounds; Error estimates; Lanczos method; Matrix functions; Partial fraction expansions

Indexed keywords

ERROR ANALYSIS; ITERATIVE METHODS; MATRIX ALGEBRA; QUANTUM THEORY; VECTORS;

ARNOLDI METHOD; CG ITERATION; ERROR BOUND; ERROR ESTIMATES; HERMITIAN MATRICES; KRYLOV SUBSPACE; LANCZOS' METHODS; MATRIX FUNCTIONS; PARTIAL FRACTION EXPANSION; SUBSPACE APPROXIMATION;

RATIONAL FUNCTIONS;

EID: 49749118692     PISSN: 10648275     EISSN: None     Source Type: Journal    
DOI: 10.1137/070684598     Document Type: Article

References (47)

1. O. AXELSSON AND A. KUCHEROV, Real valued iterative, methods for solving complex symmetric linear systems, Numer. Linear Algebra Appl., 7 (2000), pp. 197-218.
2. G. A. BAKER AND P. GRAVES-MORRIS, Padé approximants, Encyclopedia of Mathematics and Its Applications, Vol. 59, Cambridge University Press, Cambridge, UK, 1996.
3. A. BORICI, A. FROMMER, B. JOÓ, A. KENNEDY, AND B. PENDLETON, QCD and numerical analysis III, in Proceedings of the Third International Workshop on Numerical Analysis and Lattice QCD, Edinburgh, UK, 2003, Lecture Notes in Comput. Sci. Engrg. 47, Springer, Berlin, 2005.
4. D. CALVETTI, S. MORIGI, L. REICHEL, AND F. SGALLARI, Computable error bounds and estimates for the conjugate gradient method, Numer. Algorithms, 25 (2000), pp. 79-88.
5. A. J. CARPENTER, A. RUTTAN, AND R. S. VARGA, Extended numerical computations on the 1/9 conjecture in rational approximation theory, in Rational Approximation and Interpolation, P. R. Graves-Morris, E. B. Saff, and R. S. Varga, eds., Lecture Notes in Math. 1105, Springer-Verlag, Berlin, 1984, pp. 383-411.
6. P. CASTILLO AND Y. SAAD, Preconditioning the matrix exponential operator with applications, J. Sci. Comput., 13 (1999), pp. 225-302.
7. V. DRUSKIN AND L. KNIZHNERMAN, Two polynomial methods of calculating functions of symmetric matrices, U.S.S.R. Comput. Math. Math. Phys., 29 (1989), pp. 112-121.
8. V. DRUSKIN AND L. KNIZHNERMAN, Extended Krylov subspaces: Approximation of the matrix square root and related functions, SIAM J. Matrix Anal. Appl., 19 (1998), pp. 755-771.
9. A. FROMMER AND V. SIMONCINI, Matrix functions, in Model Order Reduction: Theory, Research Aspects and Applications, W. H. A. Schilders and H. A. van der Vorst, eds., Mathematics in Industry, Springer, Heidelberg, 2008, to appear.
10. G. GOLUB AND C. F. VAN LOAN, Matrix Computations, 3rd ed., The Johns Hopkins University Press, Baltimore, MD, 1996.
11. G. H. GOLUB AND G. A. MEURANT, Matrices, moments and quadrature, in Numerical Analysis 1993, D. Griffiths and G. Watson, eds., Pitman Res. Notes Math. 303, Longman Scientific and Technical, Harlow, UK, 1994, pp. 105-156.
12. G. H. GOLUB AND G. A. MEURANT, Matrices, moments and quadrature II; How to compute the norm of the, error in iterative methods, BIT, 37 (1997), pp. 687-705.
13. G. H. GOLUB AND Z. STRAKOS, Estimates in quadratic formulas, Numer. Algorithms, 8 (1994), pp. 241-268.
14. A. GREENBAUM, Estimating the attainable accuracy of recursively computed residual methods, SIAM J. Matrix Anal. Appl., 18 (1997), pp. 535-551.
15. E. HAIRER, C. LUBICH, AND G. WANNER, Geometric Numerical Integration. Structurepreserving Algorithms for Ordinary Differential Equations, Springer Ser. Comput. Math. 31, Springer, Berlin, 2002.
16. G. I. HARGREAVES AND N. J. HIGHAM, Efficient algorithms for the matrix cosine and sine, Numer. Algorithms, 40 (2005), pp. 383-400.
17. M. R. HESTENES AND E. STIEFEL, Methods of conjugate gradients for solving linear systems, J. Res. National Bureau of Standards, 49 (1952), pp. 409-436.
18. N. J. HIGHAM, Accuracy and Stability of Numerical Algorithms, SIAM, Philadelphia, PA, 1996.
19. N. J. HIGHAM, Factorizing complex symmetric matrices with positive definite real and imaginary parts, Math. Comput., 67 (1998), pp. 1591-1599.
20. N. J. HIGHAM AND M. I. SMITH, Computing the matrix cosine, Numer. Algorithms, 34 (2003), pp. 13-26.
21. M. HOCHBRUCK AND C. LUBICH, On Krylov subspace approximations to the matrix exponential operator, SIAM J. Numer. Anal., 34 (1997), pp. 1911-1925.
22. M. HOCHBRUCK AND A. OSTERMANN, Exponential Runge-Kutta methods for parabolic problems, Appl. Numer. Math., 53 (2005), pp. 323-339.
23. R. A. HORN AND C. R. JOHNSON, Topics in Matrix Analysis, Cambridge University Press, Cambridge, UK, 1994.
24. C. T. KELLEY, Iterative Methods for Linear and Nonlinear Equations, Frontiers in Appl. Math. 16, SIAM, Philadelphia, 1995.
25. L. LOPEZ AND V. SIMONCINI, Analysis of projection methods for rational function approximation to the matrix exponential, SIAM J. Numer. Anal., 44 (2006), pp. 613-635.
26. THE MATHWORKS, INC., MATLAB 7, September, 2004.
27. J. A. MEIJERINK AND H. A. VAN DER VORST, An iterative solution method for linear systems of which the coefficient matrix is a symmetric M-matrix, Math. Comp., 31 (1977), pp. 148-162.
28. G. MEURANT, The computation of bounds for the norm of the error in the conjugate gradient algorithm, Numer. Algorithms, 16 (1997), pp. 77-87.
29. 2 norm of the error in the conjugate gradient algorithm, Numer. Algorithms, 40 (2005), pp. 157-169.
30. G. MEURANT AND Z. STRAKOŠ, The Lanczos and conjugate gradient algorithms in finite precision arithmetic, in Acta. Numer. 15, Cambridge University Press, Cambridge, UK, 2006, pp. 471-542.
31. I. MORET AND P. NOVATI, RD-rational approximations of the matrix exponential, BIT, 44 (2004), pp. 595-615.
32. NATIONAL INSTITUTE OF STANDARDS AND TECHNOLOGY, Matrix Market.
33. D. P. O'LEARY, Z. STRAKOŠ, AND P. TICHÝ, On sensitivity of Gauß-Christoffel quadrature, Numer. Math., 107 (2007), pp. 147-174; available online at http://math.nist.gov/MatrixMarket/.
34. C. C. PAIGE, B. N. PARLETT, AND H. A. VAN DER VORST, Approximate solutions and eigenvalue bounds from Krylov subspaces, Numer. Linear Algebra Appl., 2 (1995), pp. 115-134.
35. B. N. PARLETT, A new look at the Lanczos algorithm for solving symmetric systems of linear equations, Linear Algebra Appl., 29 (1980), pp. 323-346.
36. P. P. PETRUSHEV AND V. A. POPOV, Rational Approximation of Real Functions, Cambridge University Press, Cambridge, UK, 1987.
37. M. POPOLIZIO AND V. SIMONCINI, Refined Acceleration Techniques for Approximating the Matrix Exponential Operator, Technical report, Dipartimento di Matematica, Università di Bologna, 2006.
38. S. M. RUMP, INTLAB-INTerval LABoratory, SIAM J. Matrix Anal. Appl., to appear.
39. Y. SAAD, Analysis of some Krylov subspace approximations to the matrix exponential operator, SIAM J. Numer. Anal., 29 (1992), pp. 209-228.
40. Y. SAAD, Iterative Methods for Sparse Linear Systems, The PWS Publishing Company, Boston, 1996; 2nd ed., SIAM, Philadelphia, 2003.
41. R. B. SIDJE, Expokit: A software package for computing matrix exponentials, ACM Trans. Math. Software, 24 (1998), pp. 130-156.
42. D. E. STEWART AND T. S. LEYK, Error estimates for Krylov subspace approximations of matrix exponentials, J. Comput. Appl. Math., 72 (1996), pp. 359-369.
43. Z. STRAKOŠ AND P. TICHÝ, On error estimation in the conjugate gradient method and why it works in finite precision computations, Electronic Trans. Numer. Anal., 13 (2002), pp. 56-80.
44. Z. STRAKOŠ AND P. TICHÝ, Error estimation in preconditioned conjugate gradients, BIT, 45 (2005), pp. 789-817.
45. J. VAN DEN ESHOF, A. FROMMER, T. LIPPERT, K. SCHILLING, AND H. VAN DER VORST, Numerical methods for the QCD overlap operator. 1: Sign-function and error bounds, Comput. Phys. Commun., 146 (2002), pp. 203-224.
46. J. VAN DEN ESHOF AND M. HOCHBRUCK, Preconditioning Lanczos approximations to the matrix exponential, SIAM J. Sci. Comput., 27 (2006), pp. 1438-1457.
47. J. VAN DEN ESHOF AND G. L. SLEIJPEN, Accurate conjugate gradient methods for families of shifted systems, Appl. Numer. Math., 49 (2004), pp. 17-37.