메뉴 건너뛰기




Volumn 296, Issue 1-3, 1999, Pages 191-211

Error bounds for the Arnoldi method: A set of extreme eigenpairs

Author keywords

Arnoldi method; Bounded operators; Exponential convergence; Green function; Matrices; Numerical range; Outermost eigenvalues; Spectrum

Indexed keywords


EID: 0033406968     PISSN: 00243795     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0024-3795(99)00122-6     Document Type: Article
Times cited : (5)

References (29)
  • 2
    • 0002807741 scopus 로고
    • The principle of minimized iterations in the solution of the matrix eigenvalue problem
    • W.E. Arnoldi, The principle of minimized iterations in the solution of the matrix eigenvalue problem, Quart. Appl. Math. 9 (1951) 17-29.
    • (1951) Quart. Appl. Math. , vol.9 , pp. 17-29
    • Arnoldi, W.E.1
  • 3
    • 0000977352 scopus 로고
    • Hybrid Krylov methods for nonlinear systems of equations
    • P.N. Brown, Y. Saad, Hybrid Krylov methods for nonlinear systems of equations, SIAM J. Sci. Statist. Comput. 11 (1990) 450-481.
    • (1990) SIAM J. Sci. Statist. Comput. , vol.11 , pp. 450-481
    • Brown, P.N.1    Saad, Y.2
  • 4
    • 0030542825 scopus 로고    scopus 로고
    • Residual relationships within three pairs of iterative algorithms for solving Ax = b
    • J. Cullum, A. Greenbaum, Residual relationships within three pairs of iterative algorithms for solving Ax = b, SIAM J. Matrix Anal. Appl. 17 (1996) 223-247.
    • (1996) SIAM J. Matrix Anal. Appl. , vol.17 , pp. 223-247
    • Cullum, J.1    Greenbaum, A.2
  • 5
    • 0032163793 scopus 로고    scopus 로고
    • From potential theory to matrix iterations in six steps
    • T.A. Driscoll, K.-C. Toh, L.N. Trefethen, From potential theory to matrix iterations in six steps, SIAM Review 40 (1998) 547-578.
    • (1998) SIAM Review , vol.40 , pp. 547-578
    • Driscoll, T.A.1    Toh, K.-C.2    Trefethen, L.N.3
  • 6
    • 0001765691 scopus 로고
    • A hybrid Chebyshev Krylov subspace algorithm for solving nonsymmetric systems of linear equations
    • H.C. Elman, Y. Saad, P.E. Saylor, A hybrid Chebyshev Krylov subspace algorithm for solving nonsymmetric systems of linear equations, SIAM J. Sci. Statist. Comput. 7 (1986) 840-855.
    • (1986) SIAM J. Sci. Statist. Comput. , vol.7 , pp. 840-855
    • Elman, H.C.1    Saad, Y.2    Saylor, P.E.3
  • 7
    • 0000269389 scopus 로고
    • Efficient solution of parabolic equations by Krylov approximation method
    • E. Gallopulos, Y. Saad, Efficient solution of parabolic equations by Krylov approximation method, SIAM J. Sci. Statist. Comput. 13 (1992) 1236-1264.
    • (1992) SIAM J. Sci. Statist. Comput. , vol.13 , pp. 1236-1264
    • Gallopulos, E.1    Saad, Y.2
  • 8
    • 0001436426 scopus 로고
    • Iterative solution of linear equations in ODE codes
    • C.W. Gear, Y. Saad, Iterative solution of linear equations in ODE codes, SIAM J. Sci. Statist. Comput. 4 (1983) 583-601.
    • (1983) SIAM J. Sci. Statist. Comput. , vol.4 , pp. 583-601
    • Gear, C.W.1    Saad, Y.2
  • 9
    • 0012746776 scopus 로고
    • Arnoldi-Tchebychev procedure for large scale nonsymmetric matrices
    • D. Ho, F. Chatelin, M. Bennami, Arnoldi-Tchebychev procedure for large scale nonsymmetric matrices, Math. Mod. and Numer. Anal. 24 (1990) 53-65.
    • (1990) Math. Mod. and Numer. Anal. , vol.24 , pp. 53-65
    • Ho, D.1    Chatelin, F.2    Bennami, M.3
  • 10
    • 0347799731 scopus 로고    scopus 로고
    • On Krylov subspace approximations to the matrix exponential operator
    • M. Hochbruck, C. Lubich, On Krylov subspace approximations to the matrix exponential operator, SIAM J. Numer. Anal. 34 (1997) 1911-1925.
    • (1997) SIAM J. Numer. Anal. , vol.34 , pp. 1911-1925
    • Hochbruck, M.1    Lubich, C.2
  • 11
    • 0004151494 scopus 로고
    • Cambridge University Press, Cambridge, London, New Rochelle
    • R.A. Horn, Ch. R. Johnson, Matrix analysis, Cambridge University Press, Cambridge, London, New Rochelle, 1986.
    • (1986) Matrix Analysis
    • Horn, R.A.1    Johnson, C.R.2
  • 12
    • 0003952516 scopus 로고
    • Cambridge University Press, Cambridge, London, New Rochelle
    • R.A. Horn, C.R. Johnson, Topics in matrix analysis, Cambridge University Press, Cambridge, London, New Rochelle, 1991.
    • (1991) Topics in Matrix Analysis
    • Horn, R.A.1    Johnson, C.R.2
  • 14
    • 0002658611 scopus 로고
    • Computation of functions of unsymmetric matrices by means of Arnoldi's method
    • Russian; is translated into English
    • L.A. Knizhnerman, Computation of functions of unsymmetric matrices by means of Arnoldi's method, J. Comput. Math, and Math. Phys. 31 (1991) 5-16 (Russian; is translated into English).
    • (1991) J. Comput. Math, and Math. Phys. , vol.31 , pp. 5-16
    • Knizhnerman, L.A.1
  • 15
    • 38249015157 scopus 로고
    • Error bounds in Arnoldi's method: The case of a normal matrix
    • L.A. Knizhnerman, Error bounds in Arnoldi's method: The case of a normal matrix, J. Comput. Math, and Math. Phys. 32 (1992) 1199-1211.
    • (1992) J. Comput. Math, and Math. Phys. , vol.32 , pp. 1199-1211
    • Knizhnerman, L.A.1
  • 17
    • 38249037752 scopus 로고
    • An application of the Arnoldi method to a geophysical fluid dynamics problem
    • A. Navarra, An application of the Arnoldi method to a geophysical fluid dynamics problem, J. Comput. Phys. 69 (1987) 143-162.
    • (1987) J. Comput. Phys. , vol.69 , pp. 143-162
    • Navarra, A.1
  • 18
    • 0003311766 scopus 로고
    • Convergence of iterations for linear equations
    • Birkhäuser, Basel
    • O. Nevanlinna, Convergence of iterations for linear equations (lectures in mathematics Eth Zürich), Birkhäuser, Basel, 1993.
    • (1993) Lectures in Mathematics Eth Zürich
    • Nevanlinna, O.1
  • 21
    • 0013091802 scopus 로고
    • The two-sided Arnoldi algorithm for unsymmetric eigenvalue problems
    • A. Ruhe, The two-sided Arnoldi algorithm for unsymmetric eigenvalue problems, Lecture Notes in Math. 973 (1982) 104-120.
    • (1982) Lecture Notes in Math. , vol.973 , pp. 104-120
    • Ruhe, A.1
  • 22
    • 49149143501 scopus 로고
    • Variations on Arnoldi's method for computing eigenelements of large unsymmetric matrices
    • Y. Saad, Variations on Arnoldi's method for computing eigenelements of large unsymmetric matrices, Linear Algebra Appl. 34 (1980) 269-295.
    • (1980) Linear Algebra Appl. , vol.34 , pp. 269-295
    • Saad, Y.1
  • 23
    • 84966222159 scopus 로고
    • Krylov subspace method for solving large unsymmetric linear systems
    • Y. Saad, Krylov subspace method for solving large unsymmetric linear systems, Math. Comput. 37 (1981) 105-126.
    • (1981) Math. Comput. , vol.37 , pp. 105-126
    • Saad, Y.1
  • 24
    • 0026818185 scopus 로고
    • Analysis of some Krylov subspace approximation to the matrix exponential operator
    • Y. Saad, Analysis of some Krylov subspace approximation to the matrix exponential operator, SIAM J. Numer. Anal. 29 (1992) 209-228.
    • (1992) SIAM J. Numer. Anal. , vol.29 , pp. 209-228
    • Saad, Y.1
  • 25
    • 0000048673 scopus 로고
    • GMRES: A generalized minimum residual algorithm for solving nonsymmetric linear systems
    • Y. Saad, M.H. Schultz, GMRES: A generalized minimum residual algorithm for solving nonsymmetric linear systems, SIAM J. Sci. Stat. Comput. 7 (1986) 856-869.
    • (1986) SIAM J. Sci. Stat. Comput. , vol.7 , pp. 856-869
    • Saad, Y.1    Schultz, M.H.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.