A generalization of the steepest descent method for matrix functions

Electronic Transactions on Numerical Analysis

Volumn 28, Issue , 2007, Pages 206-222

  Afanasjew, M ^a   Eiermann, M ^a   Ernst, O G ^a   Guttel S ^a  

^a TU BERGAKADEMIE FREIBERG   (Germany)

Author keywords

Krylov subspace approximation; Linear system of equations; Matrix function; Polynomial interpolation; Restarted Arnoldi Lanczos method; Restarted Krylov subspace method; Steepest descent

Indexed keywords

INTERPOLATION; LINEAR SYSTEMS; MATRIX ALGEBRA; POLYNOMIAL APPROXIMATION; VECTORS;

ARNOLDI; KRYLOV SUB SPACES; KRYLOV SUBSPACE METHOD; LINEAR SYSTEM OF EQUATIONS; MATRIX FUNCTIONS; POLYNOMIAL INTERPOLATION;

STEEPEST DESCENT METHOD;

EID: 54549084518     PISSN: None     EISSN: 10689613     Source Type: Journal    
DOI: None     Document Type: Article

References (19)

1. M. AFANASJEW, M. EIERMANN, O. G. ERNST, AND S. GÜTTEL, Implementation of a restarted Krylov subspace method for the evaluation of matrix functions, Linear Algebra Appl., (to appear).
2. H. AKAIKE, On a successive transformation of probability distribution and its application to the analysis of the optimum gradient method, Ann. Inst. Statist. Math. Tokio, 11 (1959), pp. 1-16.
3. A. CAUCHY, Méthode générale pour la résolution des systèmes d'équations simultanées, Comp. Rend. Sci. Paris, 25 (1847), pp. 536-538.
4. M. CROUZEIX, Numerical range and functional calculus in Hilbert space, J. Funct. Anal., 244 (2007), pp. 668-690.
5. P. J. DAVIS, Interpolation and Approximation, Dover Publications, Inc., New York, NY, 1975.
6. 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.
7. D. K. FADDEJEW AND W. N. FADDEJEWA, Numerische Methoden der Linearen Algebra, vol. 10 of Mathematik für Naturwissenschaft und Technik, VEB Deutscher Verlag der Wissenschaften, Berlin, 3. ed., 1973.
8. A. I. FORSYTHE AND G. E. FORSYTHE, Punched-card experiments with accelerated gradient methods for linear equations, National Bureau of Standards, Appl. Math. Ser., 39 (1954), pp. 55-69.
9. G. E. FORSYTHE, On the asymptotic directions of the s-dimensional optimum gradient method, Numer. Math., 11 (1968), pp. 57-76.
10. G. E. FORSYTHE AND T. S. MOTZKIN, Acceleration of the optimum gradient method (Abstract), Bull. Amer. Math. Soc., 57 (1951), pp. 304-305.
11. _, .Asymptotic properties of the optimum gradient method (Abstract), Bull. Amer. Math. Soc., 57 (1951), p. 183.
12. G. MEURANT, Computer Solution of Large Linear Systems, vol. 28 of Studies in Mathematics and its Applications, Elsevier, Amsterdam, 1999.
13. G. OPITZ, Steigungsmatrizen, Z. Angew. Math. Mech., 44 (1964), pp. T52-T54.
14. J. R. RICE, The degree of convergence for entire functions, Duke Math. J., 38 (1971), pp. 429-440.
15. Y. SAAD, Iterative Methods for Sparse Linear Systems, SIAM, Philadelphia, PA, 2nd ed., 2003.
16. E. STIEFEL, Über einige Methoden der Relaxationsrechnung, Z. Angew. Math. Phys., 3 (1952), pp. 1-33.
17. _, Relaxationsmethoden bester Strategie zur Lösung linearer Gleichungssysteme, Comment. Math. Helv., 29 (1955), pp. 157-179.
18. J. L. WALSH, Interpolation and Approximation by Rational Functions in the Complex Domain, vol. XX of American Mathematical Society Colloquium Publications, AMS, Providence, RI, 5th ed., 1969.
19. T. WINIARSKI, Approximation and interpolation of entire functions, Ann. Polon. Math., XXIII (1970), pp. 259-273.