메뉴 건너뛰기




Volumn 24, Issue 3, 2003, Pages 627-644

Convergence analysis of inexact Rayleigh quotient iteration

Author keywords

Eigenvalue; Jacobi Davidson; Preconditioning; Rayleigh quotient

Indexed keywords


EID: 0042415256     PISSN: 08954798     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895479801399596     Document Type: Article
Times cited : (39)

References (26)
  • 1
    • 18744388753 scopus 로고    scopus 로고
    • Templates for the solution of algebraic Eigenvalue problems: A practical guide
    • SIAM, Philadelphia
    • Z. BAI, J. DEMMEL, J. DONGARRA, A. RUHE, AND H. A. VAN DER VORST, EDS., Templates for the Solution of Algebraic Eigenvalue Problems: A Practical Guide, Software Environ. Tools 11, SIAM, Philadelphia, 2000.
    • (2000) Software Environ. Tools , vol.11
    • Bai, Z.1    Demmel, J.2    Dongarra, J.3    Ruhe, A.4    Van Der Vorst, H.A.5
  • 2
    • 0032203627 scopus 로고    scopus 로고
    • MINRES and MINERR are better than SYMMLQ in eigenpair computations
    • F. A. DUL, MINRES and MINERR are better than SYMMLQ in eigenpair computations, SIAM J. Sci. Comput., 19 (1998), pp. 1767-1782.
    • (1998) SIAM J. Sci. Comput. , vol.19 , pp. 1767-1782
    • Dul, F.A.1
  • 3
    • 0032131701 scopus 로고    scopus 로고
    • Jacobi-Davidson style QR and QZ algorithms for the reduction of matrix pencils
    • D. R. FOKKEMA, G. L. G. SLEIJPEN, AND H. A. VAN DER VORST, Jacobi-Davidson style QR and QZ algorithms for the reduction of matrix pencils, SIAM J. Sci. Comput., 20 (1998), pp. 94-125.
    • (1998) SIAM J. Sci. Comput. , vol.20 , pp. 94-125
    • Fokkema, D.R.1    Sleijpen, G.L.G.2    Van Der Vorst, H.A.3
  • 5
    • 85046528357 scopus 로고    scopus 로고
    • Inexact inverse iterations for the generalized eigenvalue problems
    • G. H. GOLUB AND Q. YE, Inexact inverse iterations for the generalized eigenvalue problems, BIT, 40 (2000), pp. 672-684.
    • (2000) BIT , vol.40 , pp. 672-684
    • Golub, G.H.1    Ye, Q.2
  • 7
    • 0000141536 scopus 로고
    • Convergence rate estimates for iterative methods for a mesh symmetric eigenvalue problem
    • A. V. KNYAZEV, Convergence rate estimates for iterative methods for a mesh symmetric eigenvalue problem, Soviet J. Numer. Anal. Math. Modelling, 2 (1987), pp. 371-396.
    • (1987) Soviet J. Numer. Anal. Math. Modelling , vol.2 , pp. 371-396
    • Knyazev, A.V.1
  • 8
    • 0036223489 scopus 로고    scopus 로고
    • Toward the optimal preconditioned eigensolver: Locally optimal block preconditioned conjugate gradient method
    • A. V. KNYAZEV, Toward the optimal preconditioned eigensolver: Locally optimal block preconditioned conjugate gradient method, SIAM J. Sci. Comput., 23 (2001), pp. 517-541.
    • (2001) SIAM J. Sci. Comput. , vol.23 , pp. 517-541
    • Knyazev, A.V.1
  • 9
    • 32044463478 scopus 로고    scopus 로고
    • A geometric theory for preconditioned inverse iteration III: A short and sharp convergence estimate for generalized eigenvalue problems
    • A. V. KNYAZEV AND K. NEYMEYR, A geometric theory for preconditioned inverse iteration III: A short and sharp convergence estimate for generalized eigenvalue problems, Linear Algebra Appl., 358 (2003), pp. 95-114; also available online from http://www-math.cudenver.edu/ccmreports/rep173.pdf, CU-Denver, 2001.
    • (2001) Linear Algebra Appl. , vol.358 , pp. 95-114
    • Knyazev, A.V.1    Neymeyr, K.2
  • 10
    • 0031514762 scopus 로고    scopus 로고
    • An inexact inverse iteration for large sparse eigenvalue problems
    • Y.-L. LAI, K.-Y. LIN, AND W.-W. LIN, An inexact inverse iteration for large sparse eigenvalue problems, Numer. Linear Algebra Appl., 4 (1997), pp. 425-437.
    • (1997) Numer. Linear Algebra Appl. , vol.4 , pp. 425-437
    • Lai, Y.-L.1    Lin, K.-Y.2    Lin, W.-W.3
  • 11
    • 0035586115 scopus 로고    scopus 로고
    • A geometric theory for preconditioned inverse iteration I: Extrema of the Rayleigh quotient
    • K. NEYMEYR, A geometric theory for preconditioned inverse iteration I: Extrema of the Rayleigh quotient, Linear Algebra Appl., 322 (2001), pp. 61-85.
    • (2001) Linear Algebra Appl. , vol.322 , pp. 61-85
    • Neymeyr, K.1
  • 12
    • 0035585865 scopus 로고    scopus 로고
    • A geometric theory for preconditioned inverse iteration II: Convergence estimates
    • K. NEYMEYR, A geometric theory for preconditioned inverse iteration II: Convergence estimates, Linear Algebra Appl., 322 (2001), pp. 87-104.
    • (2001) Linear Algebra Appl. , vol.322 , pp. 87-104
    • Neymeyr, K.1
  • 14
    • 0036101413 scopus 로고    scopus 로고
    • Combination of Jacobi-Davids on and conjugate gradients for the partial symmetric eigenproblem
    • Y. NOTAY, Combination of Jacobi-Davids on and conjugate gradients for the partial symmetric eigenproblem, Numer. Linear Algebra Appl., 9 (2002), pp. 21-44.
    • (2002) Numer. Linear Algebra Appl. , vol.9 , pp. 21-44
    • Notay, Y.1
  • 16
    • 0000080063 scopus 로고
    • Inverse iteration, ill-conditioned equations and Newton's method
    • G. PETERS AND J. H. WILKINSON, Inverse iteration, ill-conditioned equations and Newton's method, SIAM Rev., 21 (1979), pp. 339-360.
    • (1979) SIAM Rev. , vol.21 , pp. 339-360
    • Peters, G.1    Wilkinson, J.H.2
  • 19
    • 0009924727 scopus 로고    scopus 로고
    • Inexact Rayleigh quotient-type methods for eigenvalue computations
    • V. SIMONCINI AND L. ELDÉN, Inexact Rayleigh quotient-type methods for eigenvalue computations, BIT, 42 (2002), pp. 159-182.
    • (2002) BIT , vol.42 , pp. 159-182
    • Simoncini, V.1    Eldén, L.2
  • 20
    • 1542498668 scopus 로고    scopus 로고
    • Jacobi-Davidson type methods for generalized eigenproblems and polynomial eigenproblems
    • G. L. G. SLEIJPEN, A. BOOTEN, D. R. FOKKEMA, AND H. A. VAN DER VORST, Jacobi-Davidson type methods for generalized eigenproblems and polynomial eigenproblems, BIT, 36 (1996), pp. 595-633.
    • (1996) BIT , vol.36 , pp. 595-633
    • Sleijpen, G.L.G.1    Booten, A.2    Fokkema, D.R.3    Van Der Vorst, H.A.4
  • 21
    • 0030560293 scopus 로고    scopus 로고
    • A Jacobi-Davidson iteration method for linear eigenvalue problems
    • G. L. G. SLEIJPEN AND H. A. VAN DER VORST, A Jacobi-Davidson iteration method for linear eigenvalue problems, SIAM J. Matrix Anal. Appl., 17 (1996), pp. 401-425.
    • (1996) SIAM J. Matrix Anal. Appl. , vol.17 , pp. 401-425
    • Sleijpen, G.L.G.1    Van Der Vorst, H.A.2
  • 23
    • 0001917562 scopus 로고    scopus 로고
    • Efficient expansion of subspaces in the Jacobi-Davidson method for standard and generalized eigenproblems
    • G. L. G. SLEIJPEN, H. A. VAN DER VORST, AND E. MEIJERINK, Efficient expansion of subspaces in the Jacobi-Davidson method for standard and generalized eigenproblems, Electron. Trans. Numer. Anal., 7 (1998), pp. 75-89.
    • (1998) Electron. Trans. Numer. Anal. , vol.7 , pp. 75-89
    • Sleijpen, G.L.G.1    Van Der Vorst, H.A.2    Meijerink, E.3
  • 24
    • 0033479131 scopus 로고    scopus 로고
    • The effects of inexact solvers in algorithms for symmetric eigenvalue problems
    • P. SMIT AND M. H. C. PAARDEKOOPER, The effects of inexact solvers in algorithms for symmetric eigenvalue problems, Linear Algebra Appl., 287 (1999), pp. 337-357.
    • (1999) Linear Algebra Appl. , vol.287 , pp. 337-357
    • Smit, P.1    Paardekooper, M.H.C.2
  • 25
    • 0009196276 scopus 로고
    • Criteria for combining inverse and Rayleigh quotient iteration
    • D. B. SZYLD, Criteria for combining inverse and Rayleigh quotient iteration, SIAM J. Numer. Anal., 25 (1988), pp. 1369-1375.
    • (1988) SIAM J. Numer. Anal. , vol.25 , pp. 1369-1375
    • Szyld, D.B.1


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