Error estimates and evaluation of matrix functions via the faber transform

SIAM Journal on Numerical Analysis

Volumn 47, Issue 4, 2009, Pages 3849-3883

  Beckermann, Bernhard ^a   Reichel, Lothar ^b  

^a UNIVERSITÉ LILLE 1   (France)

^b KENT STATE UNIVERSITY   (United States)

Author keywords

Arnoldi process; Error bound; Matrix function; Polynomial approximation; Rational approximation; Rational Arnoldi process

Indexed keywords

ERROR ANALYSIS; FUNCTION EVALUATION; POLYNOMIAL APPROXIMATION;

ARNOLDI PROCESS; ERROR BOUND; ERROR ESTIMATES; FIELD OF VALUES; MATRIX FUNCTIONS; NONLINEAR FUNCTIONS; POLYNOMIAL APPROXIMATION METHODS; RATIONAL APPROXIMATIONS;

RATIONAL FUNCTIONS;

EID: 84904192266     PISSN: 00361429     EISSN: None     Source Type: Journal    
DOI: 10.1137/080741744     Document Type: Article

References (83)

1. N. I. Achieser, Elements of the Theory of Elliptic Functions, American Mathematical Society, Providence, RI,1990.
2. M. Afanasjew, M. Eiermann, O. G. Ernst, and S. Güttel, A generalization of the steepest descent method for matrix functions, Electron. Trans. Numer. Anal., 28 (2008), pp. 206-222.
3. E. J. Allen, J. Baglama, and S. K. Boyd, Numerical approximation of the product of the square root of a matrix with a vector, Linear Algebra Appl., 310 (2000), pp. 167-181.
4. J. M. Anderson and J. Clunie, Isomorphism of the disk algebra and inverse Faber sets, Math. Z., 188 (1985), pp. 545-558.
5. C. Badea, M. Crouzeix, and B. Delyon, Convex domains and K-spectral sets, Math. Z., 252 (2006), pp. 345-365.
6. L. Baratchart, V. A. Prokhorov, and E. B. Saff, On Blaschke products associated with n-widths, J. Approx. Theory, 126 (2004), pp. 40-51.
7. B. Beckermann, Image numérique, GMRES et polynômes de Faber, C. R. Acad. Sci. Paris Ser. I, 340 (2005), pp. 855-860.
8. B. Beckermann, S. A. Goreinov, and E. E. Tyrtyshnikov, Some remarks on the Elman estimate for GMRES, SIAM J. Matrix Anal. Appl., 27 (2005), pp. 772-778.
9. D. A. Bini, N. J. Higham, and B. Meini, Algorithms for the matrix pth root, Numer. Algorithms, 39 (2005), pp. 349-378.
10. D. Braess, Rational approximation of Stieltjes functions by the Carathéodory-Fejér method, Constr. Approx., 3 (1987), pp. 43-50.
11. F. Cala Rodríguez and G. López Lagomasino, Multipoint Pade-type approximants, Exact rate of convergence, Constr. Approx., 14 (1998), pp. 259-272.
12. D. Calvetti and L. Reichel, Exponential integration methods for large stiff systems of differential equations, in Iterative Methods in Scientific Computing IV, IMACS Ser. Comput. Appl. Math. 5, D. R. Kincaid and A. C. Elster, eds., IMACS, New Brunswick, 1999, pp. 237-243.
13. D. Calvetti and L. Reichel, Lanczos-based exponential filtering for discrete ill-posed problems, Numer. Algorithms, 29 (2002), pp. 45-65.
14. D. Calvetti, L. Reichel, and Q. Zhang, Iterative exponential filtering for large discrete ill-posed problems, Numer. Math., 83 (1999), pp. 535-556.
15. J. R. Cardoso and F. Silva Leite, Padé and Gregory error estimates for the logarithm of block triangular matrices, Appl. Numer. Math., 56 (2006), pp. 253-267.
16. M. Crouzeix, Operators with numerical range in a parabola, Arch. Math. (Basel), 82 (2004), pp. 517-527.
17. M. Crouzeix, Numerical range and functional calculus in Hilbert space, J. Funct. Anal., 244 (2007), pp. 668-690.
18. M. Crouzeix, A functional calculus based on the numerical range: Applications, Linear Mul-tilinear Algebra, 56 (2008), pp. 81-103.
19. M. Crouzeix and B. Delyon, Some estimates for analytic functions of strip or sectorial operators, Arch. Math. (Basel), 81 (2003), pp. 559-566.
20. J. H. Curtiss, Faber polynomials and the Faber series, Amer. Math. Monthly, 78 (1971), pp. 577-596.
21. P. I. Davies and N. J. Higham, Computing f(A)b for matrix functions f, in QCD and Numerical Analysis III, Lect. Notes Comput. Sci. Eng. 47, A. Borici, A. Frommer, B. Joo, A. Kennedy, and B. Pendleton, eds., Springer, Berlin, 2005, pp. 15-24.
22. B. Delyon and F. Delyon, Generalization of von Neumann's spectral sets and integral representation of operators, Bull. Soc. Math. France, 1 (1999), pp. 25-42.
23. F. Diele, I. Moret, and S. Ragni, Error estimates for polynomial Krylov approximations to matrix functions, SIAM J. Matrix Anal. Appl., 30 (2008), pp. 1546-1565.
24. T. A. Driscoll, Improvements to the MATLAB toolbox for Schwartz-Christoffel mapping, ACM Trans. Math. Software, 31 (2005), pp. 239-251.
25. T. A. Driscoll and L. N. Trefethen, Schwarz-Christoffel Mapping, Cambridge University Press, Cambridge, 2002.
26. V. L. Druskin and L. A. Knizhnerman, Two polynomial methods for the computation of functions of symmetric matrices, USSR Comput. Math. Math. Phys., 29 (1989), pp. 112-121.
27. V. L. Druskin and L. A. Knizhnerman, Error estimates for the simple Lanczos process when computing functions of symmetric matrices and eigenvalues, USSR Comput. Math. Math. Phys., 31 (1991), pp. 20-30.
28. V. Druskin and L. Knizhnerman, Krylov subspace approximation of eigenpairs and matrix functions in exact and computer arithmetic, Numer. Linear Algebra Appl., 2 (1995), pp. 205-217.
29. 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.
30. V. Druskin, L. Knizhnerman, and M. Zaslavsky, Solution of large scale evolutionary problems using rational Krylov subspaces with optimized shifts, SIAM J. Sci. Comput., 31 (2009), pp. 3760-3780.
31. M. Eiermann, Fields of values and iterative methods, Linear Algebra Appl., 180 (1993), pp. 167-197.
32. M. Eiermann and O. G. Ernst, A restarted Krylov subspace method for the evaluation of matrix functions, SIAM J. Numer. Anal., 44 (2006), pp. 2481-2504.
33. S. C. Eisenstat, H. C. Elman, and M. H. Schultz, Variational iterative methods for nonsymmetric systems of linear equations, SIAM J. Numer. Anal., 20 (1983), pp. 345-357.
34. S. W. Ellacott, On the Faber transform and efficient numerical rational approximation, SIAM J. Numer. Anal., 20 (1983), pp. 989-1000.
35. S. W. Ellacott and E. B. Saff, Computing with the Faber transform, in Rational Approximation and Interpolation, Lecture Notes in Math. 1105, P. R. Graves-Morris, E. B. Saff, and R. S. Varga, eds., Springer, Berlin, 1984, pp. 412-418.
36. S. D. Fisher and E. B. Saff, The asymptotic distribution of zeros of minimal Blaschke products, J. Approx. Theory, 98 (1999), pp. 104-116.
37. R. Freund, Solution of shifted linear systems by quasi-minimal residual iterations, in Numerical Linear Algebra, L. Reichel, A. Ruttan, and R. S. Varga, eds., de Gruyter, Berlin, 1993, pp. 101-121.
38. A. Frommer and V. Simoncini, Stopping criteria for rational matrix functions of Hermitian and symmetric matrices, SIAM J. Sci. Comput., 30 (2008), pp. 1387-1412.
39. D. Gaier, Lectures on Complex Approximation, Birkhäuser, Basel, 1987.
40. E. Gallopoulos and Y. Saad, Efficient solution of parabolic equations by Krylov approximation methods, SIAM J. Sci. Stat. Comput., 13 (1992), pp. 1236-1264.
41. T. Ganelius, Degree of rational approximation, in Lectures on Approximation and Value Distribution, Les Presses de Université de Montréal, Montréal, Canada, 1982.
42. G. H. Golub and C. F. Van Loan, Matrix Computations, 3rd ed., Johns Hopkins University Press, Baltimore, 1996.
43. A. A. Gonchar, Rational approximation of analytic functions, J. Soviet Math., 26 (1984), pp. 2218-2220.
44. A. Greenbaum, Iterative Methods for Solving Linear Systems, Frontiers Appl. Math. 17, SIAM, Philadelphia, 1997.
45. α, log(A), and related matrix functions by contour integrals, SIAM J. Numer. Anal., 46 (2008), pp. 2505-2523.
46. G. I. Hargreaves and N. J. Higham, Efficient algorithms for the matrix cosine and sine, Numer. Algorithms, 40 (2005), pp. 383-400.
47. P. Henrici, Applied and Computational Complex Analysis, Vol. 1, Wiley, New York, 1974.
48. N. J. Higham, Evaluating Padé approximants of the matrix logarithm, SIAM J. Matrix Anal. Appl., 22 (2001), pp. 1126-1135.
49. N. J. Higham, The scaling and squaring method for the matrix exponential revisited, SIAM J. Matrix Anal. Appl., 26 (2005), pp. 1179-1193.
50. N. J. Higham, Functions of Matrices: Theory and Computation, SIAM, Philadelphia, 2008.
51. M. Hochbruck and C. Lubich, On Krylov subspace approximations to the matrix exponential operator, SIAM J. Numer. Anal., 34 (1997), pp. 1911-1925.
52. R. A. Horn and C. R. Johnson, Topics in Matrix Analysis, Cambridge University Press, Cambridge, 1991.
53. C. Kenney and A. J. Laub, Padé error estimates for the logarithm of a matrix, Internat. J. Control, 50 (1989), pp. 707-730.
54. L. A. Knizhnerman, Calculation of functions of unsymmetric matrices using Arnoldi's method, USSR Comput. Math. Math. Phys., 31 (1991), pp. 1-9.
55. L. Knizhnerman and V. Simoncini, A new investigation of the extended Krylov subspace method for matrix function evaluations, Numer. Linear Algebra Appl., to appear.
56. T. Kovari and C. Pommerenke, On Faber polynomials and Faber expansions, Math. Z., 99 (1967), pp. 193-206.
57. F. Leja, Sur certaines suits liées aux ensemble plan et leur application à la representation conforme, Ann. Polon. Math., 4 (1957), pp. 8-13.
58. 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.
59. U. Luther and K. Rost, Matrix exponentials and inversion of confluent Vandermonde matrices, Electron. Trans. Numer. Anal., 18 (2004), pp. 91-100.
60. A. I. Markushevich, Theory of Functions of a Complex Variable, Chelsea, New York, 1985.
61. C. Moler and C. Van Loan, Nineteen dubious ways to compute the exponential of a matrix, twenty-five years later, SIAM Rev., 45 (2003), pp. 3-49.
62. I. Moret, Rational Lanczos approximations to the matrix square root and related functions, Numer. Linear Algebra Appl., 16 (2009), pp. 431-445.
63. I. Moret and P. Novati, An interpolatory approximation of the matrix exponential based on Faber polynomials, J. Comput. Appl. Math., 131 (2001), pp. 361-380.
64. R. Nevanlinna and V. Paatero, Introduction to Complex Analysis, American Mathematical Society, Providence, RI, 2007.
65. O. G. Parfenov, Estimates of the singular numbers of the Carlson imbedding operator, Math. USSR Sb., 59 (1988), pp. 497-514.
66. C. Pommerenke, Konforme Abbildungen und Fekete-Punkte, Math. Z., 89 (1965), pp. 422-438.
67. L. Reichel, Newton interpolation at Leja points, BIT, 30 (1990), pp. 332-346.
68. A. Ruhe, Rational Krylov sequence methods for eigenvalue computations, Linear Algebra Appl., 58 (1984), pp. 391-405.
69. A. Ruhe, Rational Krylov: A practical algorithm for large sparse nonsymmetric matrix pencils, SIAM J. Sci. Comput., 19 (1998), pp. 1535-1551.
70. Y. Saad, Analysis of some Krylov subspace approximations to the matrix exponential operator, SIAM J. Numer. Anal., 29 (1992), pp. 209-228.
71. Y. Saad, Iterative Methods for Sparse Linear Systems, 2nd ed., SIAM, Philadelphia, 2003.
72. Y. Saad and M. H. Schultz, GMRES: A generalized minimal residual algorithm for solving nonsymmetric linear systems, SIAM J. Sci. Stat. Comput., 7 (1986), pp. 856-869.
73. E. B. Saff and V. Totik, Logarithmic Potentials with External Fields, Springer, Berlin, 1997.
74. T. Schmelzer and L. N. Trefethen, Evaluating matrix functions for exponential integrators via Carathéodory-Fejér approximation and contour integration, Electron. Trans. Numer. Anal., 29 (2007), pp. 1-18.
75. A. Schönhage, Approximationstheorie, de Gruyter, Berlin, 1971.
76. R. B. Sidje, Expokit: A software package for computing matrix exponentials, ACM Trans. Math. Software, 24 (1998), pp. 130-156.
77. H. Stahl and V. Totik, General Orthogonal Polynomials, Cambridge University Press, Cambridge, 1992.
78. P. K. Suetin, Fundamental properties of Faber polynomials, Russian Math. Surveys, 19 (1964), pp. 121-149.
79. S. P. Suetin, On the Montessus de Ballore's theorem for nonlinear Padé approximants of orthogonal expansions and Faber series, Soviet Math. Dokl., 22 (1980), pp. 274-277.
80. K.-C. Toh and L. N. Trefethen, The Kreiss matrix theorem on a general complex domain, SIAM J. Matrix Anal. Appl., 21 (1999), pp. 145-165.
81. J. van den Eshof and M. Hochbruck, Preconditioning Lanczos approximations to the matrix exponential, SIAM J. Sci. Comput., 27 (2006), pp. 1438-1457.
82. J. van den Eshof and G. L. G. Sleijpen, Accurate conjugate gradient methods for families of shifted systems, Appl. Numer. Math., 49 (2004), pp. 17-37.
83. J. L. Walsh, Interpolation and Approximation by Rational Functions in the Complex Domain, 5th ed., American Mathematical Society, Providence, RI, 1969.