메뉴 건너뛰기




Volumn 8, Issue , 2002, Pages 3-179

Computational methods for large eigenvalue problems

Author keywords

[No Author keywords available]

Indexed keywords


EID: 1342299960     PISSN: 15708659     EISSN: None     Source Type: Book Series    
DOI: 10.1016/S1570-8659(02)08003-1     Document Type: Review
Times cited : (47)

References (183)
  • 2
    • 0002807741 scopus 로고
    • The principle of minimized iteration in the solution of the matrix eigenproblem
    • Arnoldi W.E. The principle of minimized iteration in the solution of the matrix eigenproblem. Quart. Appl. Math. 9 (1951) 17-29
    • (1951) Quart. Appl. Math. , vol.9 , pp. 17-29
    • Arnoldi, W.E.1
  • 3
    • 0005532228 scopus 로고    scopus 로고
    • Computation of a few close eigenvalues of a large matrix with application to liquid crystal modeling
    • Baglama J., Calvetti D., Reichel L., and Ruttan A. Computation of a few close eigenvalues of a large matrix with application to liquid crystal modeling. J. Comput. Phys. 146 (1998) 203-226
    • (1998) J. Comput. Phys. , vol.146 , pp. 203-226
    • Baglama, J.1    Calvetti, D.2    Reichel, L.3    Ruttan, A.4
  • 5
    • 0040658244 scopus 로고
    • ABLE: An adaptive block Lanczos method for non-Hermitian eigenvalue problems
    • University of Kentucky, Lexington, KY
    • Bai Z., Day D., and Ye Q. ABLE: An adaptive block Lanczos method for non-Hermitian eigenvalue problems. Technical Report Research Report 95-04 (1995), University of Kentucky, Lexington, KY
    • (1995) Technical Report Research Report 95-04
    • Bai, Z.1    Day, D.2    Ye, Q.3
  • 7
    • 43949169431 scopus 로고
    • On swapping diagonal blocks in real Schur form
    • Bai Z., and Demmel J.W. On swapping diagonal blocks in real Schur form. Linear Algebra Appl. 186 (1993) 73-95
    • (1993) Linear Algebra Appl. , vol.186 , pp. 73-95
    • Bai, Z.1    Demmel, J.W.2
  • 8
    • 0006551950 scopus 로고
    • A Newton basis GMRES implementation
    • Bai Z., Hu D., and Reichel L. A Newton basis GMRES implementation. IMA J. Numer. Anal. 14 (1991) 563-581
    • (1991) IMA J. Numer. Anal. , vol.14 , pp. 563-581
    • Bai, Z.1    Hu, D.2    Reichel, L.3
  • 9
    • 0008497288 scopus 로고
    • SRRIT - A FORTRAN subroutine to calculate the dominant invariant subspace of a nonsymmetric matrix
    • Department of Computer Science, University of Maryland
    • Bai Z., and Stewart G.W. SRRIT - A FORTRAN subroutine to calculate the dominant invariant subspace of a nonsymmetric matrix. Technical Report 2908 (1992), Department of Computer Science, University of Maryland
    • (1992) Technical Report 2908
    • Bai, Z.1    Stewart, G.W.2
  • 11
    • 4644369885 scopus 로고
    • Norms and exclusion theorems
    • Bauer F.L., and Fike C.T. Norms and exclusion theorems. Numer. Math. 2 (1960) 137-141
    • (1960) Numer. Math. , vol.2 , pp. 137-141
    • Bauer, F.L.1    Fike, C.T.2
  • 12
    • 0013394483 scopus 로고    scopus 로고
    • Harmonic Ritz and Lehmann bounds
    • Beattie C. Harmonic Ritz and Lehmann bounds. ETNA 7 (1998) 18-39
    • (1998) ETNA , vol.7 , pp. 18-39
    • Beattie, C.1
  • 13
    • 0039287162 scopus 로고
    • The two-sided block Jacobi method on hypercube architectures
    • Heath M.T. (Ed), SIAM, Philadelphia, PA
    • Bischof C.H. The two-sided block Jacobi method on hypercube architectures. In: Heath M.T. (Ed). Hypercube Multiprocessors (1987), SIAM, Philadelphia, PA
    • (1987) Hypercube Multiprocessors
    • Bischof, C.H.1
  • 16
    • 0040471986 scopus 로고
    • The influence of large nonnormality on the quality of convergence of iterative methods in linear algebra
    • CERFACS, Toulouse
    • Braconnier T., Chatelin F., and Frayssé V. The influence of large nonnormality on the quality of convergence of iterative methods in linear algebra. Technical Report TR-PA-94/07 (1994), CERFACS, Toulouse
    • (1994) Technical Report TR-PA-94/07
    • Braconnier, T.1    Chatelin, F.2    Frayssé, V.3
  • 17
    • 0001595001 scopus 로고    scopus 로고
    • Computing the field of values and pseudospectra using the Lanczos method with continuation
    • Braconnier T., and Higham N.J. Computing the field of values and pseudospectra using the Lanczos method with continuation. BIT 36 3 (1996) 422-440
    • (1996) BIT , vol.36 , Issue.3 , pp. 422-440
    • Braconnier, T.1    Higham, N.J.2
  • 18
    • 0002115256 scopus 로고
    • The solution of singular value and symmetric eigenvalue problems on multiprocessor arrays
    • Brent R.P., and Luk F.T. The solution of singular value and symmetric eigenvalue problems on multiprocessor arrays. SIAM J. Sci. Statist. Comput. 6 (1985) 69-84
    • (1985) SIAM J. Sci. Statist. Comput. , vol.6 , pp. 69-84
    • Brent, R.P.1    Luk, F.T.2
  • 19
    • 0003030455 scopus 로고
    • Treatment of near breakdown in the CGS algorithm
    • Brezinski C., and Redivo-Zaglia M. Treatment of near breakdown in the CGS algorithm. Numer. Algorithms 7 (1994) 33-73
    • (1994) Numer. Algorithms , vol.7 , pp. 33-73
    • Brezinski, C.1    Redivo-Zaglia, M.2
  • 20
    • 0007949423 scopus 로고
    • Spectral portrait for non-Hermitian large sparse matrices
    • Carpraux J.F., Erhel J., and Sadkane M. Spectral portrait for non-Hermitian large sparse matrices. Computing 53 (1994) 301-310
    • (1994) Computing , vol.53 , pp. 301-310
    • Carpraux, J.F.1    Erhel, J.2    Sadkane, M.3
  • 25
    • 0001126627 scopus 로고    scopus 로고
    • Arnoldi versus nonsymmetric Lanczos algorithms for solving matrix eigenvalue problems
    • Cullum J. Arnoldi versus nonsymmetric Lanczos algorithms for solving matrix eigenvalue problems. BIT 36 3 (1996) 470-493
    • (1996) BIT , vol.36 , Issue.3 , pp. 470-493
    • Cullum, J.1
  • 27
    • 0040145952 scopus 로고
    • A practical procedure for computing eigenvalues of large sparse nonsymmetric matrices
    • Cullum J., and Willoughby R.A. (Eds), Amsterdam, North-Holland
    • Cullum J., and Willoughby R.A. A practical procedure for computing eigenvalues of large sparse nonsymmetric matrices. In: Cullum J., and Willoughby R.A. (Eds). Large Scale Eigenvalue Problems (1986), Amsterdam, North-Holland 193-240
    • (1986) Large Scale Eigenvalue Problems , pp. 193-240
    • Cullum, J.1    Willoughby, R.A.2
  • 28
    • 0000659575 scopus 로고
    • A divide and conquer method for the symmetric eigenproblem
    • Cuppen J.J.M. A divide and conquer method for the symmetric eigenproblem. Numer. Math. 36 (1981) 177-195
    • (1981) Numer. Math. , vol.36 , pp. 177-195
    • Cuppen, J.J.M.1
  • 29
    • 84966217951 scopus 로고
    • Reorthogonalization and stable algorithms for updating the Gram-Schmidt QR factorization
    • Daniel J.W., Gragg W.B., Kaufmann L., and Stewart G.W. Reorthogonalization and stable algorithms for updating the Gram-Schmidt QR factorization. Math. Comput. 30 (1976) 772-795
    • (1976) Math. Comput. , vol.30 , pp. 772-795
    • Daniel, J.W.1    Gragg, W.B.2    Kaufmann, L.3    Stewart, G.W.4
  • 30
    • 5344230920 scopus 로고
    • The iterative calculation of a few of the lowest eigenvalues and corresponding eigenvectors of large real symmetric matrices
    • Davidson E.R. The iterative calculation of a few of the lowest eigenvalues and corresponding eigenvectors of large real symmetric matrices. J. Comput. Phys. 17 (1975) 87-94
    • (1975) J. Comput. Phys. , vol.17 , pp. 87-94
    • Davidson, E.R.1
  • 31
    • 0000248114 scopus 로고
    • Monster matrices: their eigenvalues and eigenvectors
    • Davidson E.R. Monster matrices: their eigenvalues and eigenvectors. Comput. in Phys. 7 (1993) 519-522
    • (1993) Comput. in Phys. , vol.7 , pp. 519-522
    • Davidson, E.R.1
  • 33
    • 0001693314 scopus 로고
    • Numerical solution of a quadratic matrix equation
    • Davis C.J. Numerical solution of a quadratic matrix equation. SIAM J. Sci. Statist. Comput. 2 (1981) 164-175
    • (1981) SIAM J. Sci. Statist. Comput. , vol.2 , pp. 164-175
    • Davis, C.J.1
  • 34
    • 0029390218 scopus 로고
    • Reducing the effect of global communication in GM-RES(m) and CG on parallel distributed memory computers
    • de Sturler E., and van der Vorst H.A. Reducing the effect of global communication in GM-RES(m) and CG on parallel distributed memory computers. Appl. Numer. Math. 18 (1995) 441-459
    • (1995) Appl. Numer. Math. , vol.18 , pp. 441-459
    • de Sturler, E.1    van der Vorst, H.A.2
  • 36
    • 84971972448 scopus 로고
    • Parallel numerical linear algebra
    • Cambridge University Press, Cambridge
    • Demmel J., Heath M., and van der Vorst H. Parallel numerical linear algebra. Acta Numerica (1993), Cambridge University Press, Cambridge
    • (1993) Acta Numerica
    • Demmel, J.1    Heath, M.2    van der Vorst, H.3
  • 38
    • 21144468781 scopus 로고
    • Jacobi's method is more accurate than QR
    • Demmel J.W., and Veselic K. Jacobi's method is more accurate than QR. SIAM J. Matrix Anal. Appl. 13 (1992) 1204-1245
    • (1992) SIAM J. Matrix Anal. Appl. , vol.13 , pp. 1204-1245
    • Demmel, J.W.1    Veselic, K.2
  • 40
    • 0000417182 scopus 로고
    • A fully parallel algorithm for the symmetric eigenvalue problem
    • Dongarra J.J., and Sorensen D.C. A fully parallel algorithm for the symmetric eigenvalue problem. SIAM J. Sci. Statist. Comput. 8 (1987) 139-154
    • (1987) SIAM J. Sci. Statist. Comput. , vol.8 , pp. 139-154
    • Dongarra, J.J.1    Sorensen, D.C.2
  • 42
    • 0000942136 scopus 로고
    • A minimax theory for overdamped networks
    • Duffin R.J. A minimax theory for overdamped networks. J. Rational Mechanics Anal. 4 (1955) 221-233
    • (1955) J. Rational Mechanics Anal. , vol.4 , pp. 221-233
    • Duffin, R.J.1
  • 43
    • 0040471978 scopus 로고
    • Solution to the complex eigenproblem by a norm-reducing Jacobi-type method
    • Eberlein P.J. Solution to the complex eigenproblem by a norm-reducing Jacobi-type method. Numer. Math. 14 (1970) 232-245
    • (1970) Numer. Math. , vol.14 , pp. 232-245
    • Eberlein, P.J.1
  • 44
    • 0039287340 scopus 로고    scopus 로고
    • Convergence of Krylov subspace methods for non-normal matrices
    • Oxford University Computing Laboratory, Oxford
    • Embree M. Convergence of Krylov subspace methods for non-normal matrices. PhD thesis (1999), Oxford University Computing Laboratory, Oxford
    • (1999) PhD thesis
    • Embree, M.1
  • 45
    • 0021416130 scopus 로고
    • Necessary and sufficient conditions for the existence of a conjugate gradient method
    • Faber V., and Manteuffel T.A. Necessary and sufficient conditions for the existence of a conjugate gradient method. SIAM J. Numer. Anal. 21 2 (1984) 352-362
    • (1984) SIAM J. Numer. Anal. , vol.21 , Issue.2 , pp. 352-362
    • Faber, V.1    Manteuffel, T.A.2
  • 46
    • 84972535723 scopus 로고
    • Block diagonally dominant matrices in generalizations of the Gerschgorin circle theorem
    • Feingold D.G., and Varga R.S. Block diagonally dominant matrices in generalizations of the Gerschgorin circle theorem. Pacific J. Math. 12 (1962) 1241-1250
    • (1962) Pacific J. Math. , vol.12 , pp. 1241-1250
    • Feingold, D.G.1    Varga, R.S.2
  • 47
    • 0029308198 scopus 로고
    • A linear circuit analysis by Padé approximation via the Lanczos process
    • Feldmann P., and Freund R.W. A linear circuit analysis by Padé approximation via the Lanczos process. IEEE Trans. Computer-Aided Design 14 (1995)
    • (1995) IEEE Trans. Computer-Aided Design , vol.14
    • Feldmann, P.1    Freund, R.W.2
  • 48
    • 0000617787 scopus 로고
    • Numerical determination of fundamental modes
    • Flanders D.A., and Shortley G. Numerical determination of fundamental modes. J. Appl. Phys. 21 (1950) 1322-1328
    • (1950) J. Appl. Phys. , vol.21 , pp. 1322-1328
    • Flanders, D.A.1    Shortley, G.2
  • 49
    • 0003798997 scopus 로고    scopus 로고
    • Subspace methods for linear, nonlinear, and eigen problems
    • Utrecht University, Utrecht
    • Fokkema D.R. Subspace methods for linear, nonlinear, and eigen problems. PhD thesis (1996), Utrecht University, Utrecht
    • (1996) PhD thesis
    • Fokkema, D.R.1
  • 50
    • 0032131701 scopus 로고    scopus 로고
    • Jacobi-Davidson style QR and QZ algorithms for the reduction of matrix pencils
    • Fokkema D.R., Sleijpen G.L.G., and van der Vorst H.A. Jacobi-Davidson style QR and QZ algorithms for the reduction of matrix pencils. SIAM J. Sci. Comput. 20 (1998) 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
  • 51
    • 0000394782 scopus 로고
    • The QR transformation: a unitary analogue to the LR transformation, Parts I and II
    • Francis J.G.F. The QR transformation: a unitary analogue to the LR transformation, Parts I and II. Comput. J. 4 (1961) 265-272
    • (1961) Comput. J. , vol.4 , pp. 265-272
    • Francis, J.G.F.1
  • 52
    • 0000394779 scopus 로고
    • The QR transformation: a unitary analogue to the LR transformation, Parts I and II
    • Francis J.G.F. The QR transformation: a unitary analogue to the LR transformation, Parts I and II. Comput. J. 4 (1961) 332-345
    • (1961) Comput. J. , vol.4 , pp. 332-345
    • Francis, J.G.F.1
  • 53
    • 0001378925 scopus 로고
    • An implementation of the look-ahead Lanczos algorithm for non-Hermitian matrices
    • Freund R.W., Gutknecht M.H., and Nachtigal N.M. An implementation of the look-ahead Lanczos algorithm for non-Hermitian matrices. SIAM J. Sci. Comput. 14 (1993) 137-158
    • (1993) SIAM J. Sci. Comput. , vol.14 , pp. 137-158
    • Freund, R.W.1    Gutknecht, M.H.2    Nachtigal, N.M.3
  • 54
    • 0344780086 scopus 로고
    • An implementation of the look-ahead Lanczos algorithm for non-Hermitian matrices, Part 2
    • RIACS, NASA Ames Research Center
    • Freund R.W., and Nachtigal N.M. An implementation of the look-ahead Lanczos algorithm for non-Hermitian matrices, Part 2. Technical Report 90.46 (1990), RIACS, NASA Ames Research Center
    • (1990) Technical Report 90.46
    • Freund, R.W.1    Nachtigal, N.M.2
  • 55
    • 25444452938 scopus 로고
    • QMR: a quasi-minimal residual method for non-Hermitian linear systems
    • Freund R.W., and Nachtigal N.M. QMR: a quasi-minimal residual method for non-Hermitian linear systems. Numer. Math. 60 (1991) 315-339
    • (1991) Numer. Math. , vol.60 , pp. 315-339
    • Freund, R.W.1    Nachtigal, N.M.2
  • 57
    • 38249009170 scopus 로고
    • Quasi-kernel polynomials and their use in non-Hermitian matrix iterations
    • Freund R.W. Quasi-kernel polynomials and their use in non-Hermitian matrix iterations. J. Comput. Appl. Math. 43 (1992) 135-158
    • (1992) J. Comput. Appl. Math. , vol.43 , pp. 135-158
    • Freund, R.W.1
  • 59
  • 60
    • 0346590878 scopus 로고
    • The Jacobi method for real symmetric matrices
    • Goldstine H.H., Murray F.J., and von Neumann J. The Jacobi method for real symmetric matrices. J. ACM 6 (1959) 176-195
    • (1959) J. ACM , vol.6 , pp. 176-195
    • Goldstine, H.H.1    Murray, F.J.2    von Neumann, J.3
  • 61
    • 0001707575 scopus 로고
    • The block Lanczos method for computing eigenvalues
    • Rice J.R. (Ed), Academic Press, New York
    • Golub G.H., and Underwood R. The block Lanczos method for computing eigenvalues. In: Rice J.R. (Ed). Mathematical Software III (1977), Academic Press, New York 361-377
    • (1977) Mathematical Software III , pp. 361-377
    • Golub, G.H.1    Underwood, R.2
  • 64
    • 0017011163 scopus 로고
    • III-conditioned eigensystems and the computation of the Jordan canonical form
    • Golub G.H., and Wilkinson J.H. III-conditioned eigensystems and the computation of the Jordan canonical form. SIAM Rev. 18 (1976) 578-619
    • (1976) SIAM Rev. , vol.18 , pp. 578-619
    • Golub, G.H.1    Wilkinson, J.H.2
  • 65
    • 0033443621 scopus 로고    scopus 로고
    • Ritz and Harmonic Ritz values and the convergences of FOM and GMRES
    • Goossens S., and Roose D. Ritz and Harmonic Ritz values and the convergences of FOM and GMRES. Numer. Linear Algebra Appl. 6 4 (1999) 281-293
    • (1999) Numer. Linear Algebra Appl. , vol.6 , Issue.4 , pp. 281-293
    • Goossens, S.1    Roose, D.2
  • 66
    • 0040471953 scopus 로고
    • A method for finding roots of arbitrary matrices
    • Greenstadt J. A method for finding roots of arbitrary matrices. Math. Tables Aids Comput. 9 (1955) 47-52
    • (1955) Math. Tables Aids Comput. , vol.9 , pp. 47-52
    • Greenstadt, J.1
  • 67
    • 84968505027 scopus 로고
    • Computing eigenvalues and eigenvectors of a symmetric matrix on the ILLIAC
    • Gregory R.T. Computing eigenvalues and eigenvectors of a symmetric matrix on the ILLIAC. Math. Tables Aids Comput. 7 (1953) 215-220
    • (1953) Math. Tables Aids Comput. , vol.7 , pp. 215-220
    • Gregory, R.T.1
  • 68
    • 0006065489 scopus 로고
    • Model reduction of state space systems via an Implicitly Restarted Lanczos method
    • Dept. of Comp. and Appl. Math., Rice University, Houston, TX
    • Grimme E.J., Sorensen D.C., and Van Dooren P. Model reduction of state space systems via an Implicitly Restarted Lanczos method. Technical Report Report TR94-21 (1994), Dept. of Comp. and Appl. Math., Rice University, Houston, TX
    • (1994) Technical Report Report TR94-21
    • Grimme, E.J.1    Sorensen, D.C.2    Van Dooren, P.3
  • 69
    • 21844526695 scopus 로고
    • A divide-and-conquer algorithm for the symmetric tridiagonal eigenproblem
    • Gu M., and Eisenstat S.C. A divide-and-conquer algorithm for the symmetric tridiagonal eigenproblem. SIAM J. Matrix Anal. Appl. 16 (1995) 172-191
    • (1995) SIAM J. Matrix Anal. Appl. , vol.16 , pp. 172-191
    • Gu, M.1    Eisenstat, S.C.2
  • 70
    • 21844500966 scopus 로고
    • Numerical solutions for large sparse quadratic eigenvalue problems
    • Guo J.-S., Lin W.-W., and Wang C.-S. Numerical solutions for large sparse quadratic eigenvalue problems. Linear Algebra Appl. 225 (1995) 57-89
    • (1995) Linear Algebra Appl. , vol.225 , pp. 57-89
    • Guo, J.-S.1    Lin, W.-W.2    Wang, C.-S.3
  • 71
    • 0000497979 scopus 로고
    • A completed theory of the unsymmetric Lanczos process and related algorithms, Part I
    • Gutknecht M.H. A completed theory of the unsymmetric Lanczos process and related algorithms, Part I. SIAM J. Matrix Anal. Appl. 13 (1992) 594-639
    • (1992) SIAM J. Matrix Anal. Appl. , vol.13 , pp. 594-639
    • Gutknecht, M.H.1
  • 72
    • 85011492167 scopus 로고    scopus 로고
    • Lanczos-type solvers for nonsymmetric linear systems of equations
    • Cambridge University Press, Cambridge
    • Gutknecht M.H. Lanczos-type solvers for nonsymmetric linear systems of equations. Acta Numerica (1997), Cambridge University Press, Cambridge 271-397
    • (1997) Acta Numerica , pp. 271-397
    • Gutknecht, M.H.1
  • 73
    • 0005567750 scopus 로고    scopus 로고
    • Stability and transition of attachment-line flow
    • Universiteit Twente, Enschede, The Netherlands
    • Heeg R. Stability and transition of attachment-line flow. PhD thesis (1998), Universiteit Twente, Enschede, The Netherlands
    • (1998) PhD thesis
    • Heeg, R.1
  • 74
    • 0040742107 scopus 로고
    • On the speed of convergence of cyclic and quasicyclic Jacobi methods for computing the eigenvalues of Hermitian matrices
    • Henrici P. On the speed of convergence of cyclic and quasicyclic Jacobi methods for computing the eigenvalues of Hermitian matrices. SIAM J. Appl. Math. 6 (1958) 144-162
    • (1958) SIAM J. Appl. Math. , vol.6 , pp. 144-162
    • Henrici, P.1
  • 76
    • 0000678479 scopus 로고
    • A new proof of global convergence for the tridiagonal QL algorithm
    • Hoffmann W., and Parlett B.N. A new proof of global convergence for the tridiagonal QL algorithm. SIAM J. Numer. Anal. 15 (1978) 929-937
    • (1978) SIAM J. Numer. Anal. , vol.15 , pp. 929-937
    • Hoffmann, W.1    Parlett, B.N.2
  • 77
    • 0000237258 scopus 로고
    • Ueber eine neue Auflösungsart der bei der Methode der kleinsten Quadrate vorkommende linearen Gleichungen
    • Jacobi C.G.J. Ueber eine neue Auflösungsart der bei der Methode der kleinsten Quadrate vorkommende linearen Gleichungen. Astronom. Nachr. (1845) 297-306
    • (1845) Astronom. Nachr. , pp. 297-306
    • Jacobi, C.G.J.1
  • 78
    • 84868361941 scopus 로고
    • Ueber ein leichtes Verfahren, die in der Theorie der SÄcularstörungen vorkommenden Gleichungen numerisch aufzulösen
    • Jacobi C.G.J. Ueber ein leichtes Verfahren, die in der Theorie der SÄcularstörungen vorkommenden Gleichungen numerisch aufzulösen. J. Reine Angew. Math. 30 (1846) 51-94
    • (1846) J. Reine Angew. Math. , vol.30 , pp. 51-94
    • Jacobi, C.G.J.1
  • 79
    • 0038866149 scopus 로고    scopus 로고
    • Refined iterative algorithms based on Arnoldi's process for large unsymmetric eigenproblems
    • Jia Z. Refined iterative algorithms based on Arnoldi's process for large unsymmetric eigenproblems. Linear Algebra Appl. 259 (1997) 1-23
    • (1997) Linear Algebra Appl. , vol.259 , pp. 1-23
    • Jia, Z.1
  • 80
    • 0042496332 scopus 로고    scopus 로고
    • A refined iterative algorithm based on the block Arnoldi process for large unsymmetric eigenproblems
    • Jia Z. A refined iterative algorithm based on the block Arnoldi process for large unsymmetric eigenproblems. Linear Algebra Appl. 270 (1998) 171-189
    • (1998) Linear Algebra Appl. , vol.270 , pp. 171-189
    • Jia, Z.1
  • 81
    • 0039627923 scopus 로고    scopus 로고
    • Polynomial characterizations of the approximate eigenvectors by the refined Arnoldi method and implicitly restarted refined Arnoldi algorithm
    • Jia Z. Polynomial characterizations of the approximate eigenvectors by the refined Arnoldi method and implicitly restarted refined Arnoldi algorithm. Linear Algebra Appl. 287 (1999) 191-214
    • (1999) Linear Algebra Appl. , vol.287 , pp. 191-214
    • Jia, Z.1
  • 82
    • 0345960480 scopus 로고    scopus 로고
    • An analysis of the Rayleigh-Ritz method for approximating eigenspaces
    • University of Maryland, Department of Computer Science
    • Jia Z., and Stewart G.W. An analysis of the Rayleigh-Ritz method for approximating eigenspaces. Technical Report TR-99-24/TR-4015 (1999), University of Maryland, Department of Computer Science
    • (1999) Technical Report TR-99-24/TR-4015
    • Jia, Z.1    Stewart, G.W.2
  • 83
    • 0021564159 scopus 로고
    • The generalized singular value decomposition and the general A - λB problem
    • K»gström B. The generalized singular value decomposition and the general A - λB problem. BIT 24 (1985) 568-583
    • (1985) BIT , vol.24 , pp. 568-583
    • Kgström, B.1
  • 84
    • 0000169752 scopus 로고
    • RGSVD: An algorithm for computing the Kronecker structure and reducing subspaces of singular A - λB pencils
    • K»gström B. RGSVD: An algorithm for computing the Kronecker structure and reducing subspaces of singular A - λB pencils. SIAM J. Sci. Statist. Comput. 7 (1986) 185-211
    • (1986) SIAM J. Sci. Statist. Comput. , vol.7 , pp. 185-211
    • Kgström, B.1
  • 85
    • 84968508687 scopus 로고
    • Estimates for some computational techniques in linear algebra
    • Kaniel S. Estimates for some computational techniques in linear algebra. Math. Comp. 20 (1966) 369-378
    • (1966) Math. Comp. , vol.20 , pp. 369-378
    • Kaniel, S.1
  • 86
    • 1642278713 scopus 로고
    • On the upper and lower bounds of eigenvalues
    • Kato T. On the upper and lower bounds of eigenvalues. J. Phys. Soc. Japan 4 (1949) 334-339
    • (1949) J. Phys. Soc. Japan , vol.4 , pp. 334-339
    • Kato, T.1
  • 87
    • 0004523003 scopus 로고
    • On an approach to the solution of the generalized latent value problem for λ-matrices
    • Kublanovskaja V.N. On an approach to the solution of the generalized latent value problem for λ-matrices. SIAM J. Numer. Anal. 7 (1970) 532-537
    • (1970) SIAM J. Numer. Anal. , vol.7 , pp. 532-537
    • Kublanovskaja, V.N.1
  • 89
    • 0000094594 scopus 로고
    • An iteration method for the solution of the eigenvalue problem of linear differential and integral operators
    • Lanczos C. An iteration method for the solution of the eigenvalue problem of linear differential and integral operators. J. Res. Natl. Bur. Stand. 45 (1950) 225-280
    • (1950) J. Res. Natl. Bur. Stand. , vol.45 , pp. 225-280
    • Lanczos, C.1
  • 90
    • 0003398168 scopus 로고
    • Prentice-Hall, Englewood Cliffs, NJ
    • Lanczos C. Applied Analysis (1956), Prentice-Hall, Englewood Cliffs, NJ
    • (1956) Applied Analysis
    • Lanczos, C.1
  • 91
    • 21844500067 scopus 로고
    • A practical upper bound for departure from normality
    • Lee S.L. A practical upper bound for departure from normality. SIAM J. Matrix Anal. Appl. 16 (1995) 462-468
    • (1995) SIAM J. Matrix Anal. Appl. , vol.16 , pp. 462-468
    • Lee, S.L.1
  • 92
    • 0039742356 scopus 로고
    • Optimale Eigenwerteinschlie§ungen
    • Lehmann N.J. Optimale Eigenwerteinschlie§ungen. Numer. Math. 5 (1963) 246-272
    • (1963) Numer. Math. , vol.5 , pp. 246-272
    • Lehmann, N.J.1
  • 93
    • 0345326768 scopus 로고
    • Zur Verwendung optimaler Eigenwerteingrenzungen bei der Lösung symmetrischer Matrizenaufgaben
    • Lehmann N.J. Zur Verwendung optimaler Eigenwerteingrenzungen bei der Lösung symmetrischer Matrizenaufgaben. Numer. Math. 8 (1966) 42-55
    • (1966) Numer. Math. , vol.8 , pp. 42-55
    • Lehmann, N.J.1
  • 95
    • 0003572311 scopus 로고
    • Analysis and implementation of an implicitly restarted iteration
    • Rice University, Houston, TX
    • Lehoucq R.B. Analysis and implementation of an implicitly restarted iteration. PhD thesis (1995), Rice University, Houston, TX
    • (1995) PhD thesis
    • Lehoucq, R.B.1
  • 96
    • 0032217348 scopus 로고    scopus 로고
    • Using generalized Cayley transformations within an inexact rational Krylov sequence method
    • Lehoucq R.B., and Meerbergen K. Using generalized Cayley transformations within an inexact rational Krylov sequence method. SIAM J. Matrix Anal. Appl. 20 (1998) 131-148
    • (1998) SIAM J. Matrix Anal. Appl. , vol.20 , pp. 131-148
    • Lehoucq, R.B.1    Meerbergen, K.2
  • 97
    • 0003655113 scopus 로고    scopus 로고
    • An evaluation of software for computing eigenvalues of sparse non-symmetric matrices
    • Math. and Comp. Science Div., Argonne National Laboratory
    • Lehoucq R.B., and Scott J.A. An evaluation of software for computing eigenvalues of sparse non-symmetric matrices. Technical Report Preprint MCS-P547-1195 (1996), Math. and Comp. Science Div., Argonne National Laboratory
    • (1996) Technical Report Preprint MCS-P547-1195
    • Lehoucq, R.B.1    Scott, J.A.2
  • 98
    • 0004141860 scopus 로고
    • ARPACK: An implementation of the Implicitly Re-started Arnoldi Iteration that computes some of the eigenvalues and eigenvectors of a large sparse matrix
    • Rice University, Houston, TX
    • Lehoucq R.B., Sorensen D.C., Vu P., and Yang C. ARPACK: An implementation of the Implicitly Re-started Arnoldi Iteration that computes some of the eigenvalues and eigenvectors of a large sparse matrix. Technical report (1995), Rice University, Houston, TX
    • (1995) Technical report
    • Lehoucq, R.B.1    Sorensen, D.C.2    Vu, P.3    Yang, C.4
  • 100
    • 67649377633 scopus 로고    scopus 로고
    • Domain decomposition methods for eigenvalue problems
    • Hong Kong University of Science and Technology, Hong Kong
    • Lui S.H. Domain decomposition methods for eigenvalue problems. Technical Report (1996), Hong Kong University of Science and Technology, Hong Kong
    • (1996) Technical Report
    • Lui, S.H.1
  • 101
    • 0031082730 scopus 로고    scopus 로고
    • Computation of pseudospectra by continuation
    • Lui S.H. Computation of pseudospectra by continuation. SIAM J. Sci. Comput. 18 (1997) 565-573
    • (1997) SIAM J. Sci. Comput. , vol.18 , pp. 565-573
    • Lui, S.H.1
  • 102
    • 0041066067 scopus 로고
    • Homotopy method for the numerical solution of the eigenvalue problem of self-adjoint partial differential operators
    • Lui S.H., and Golub G.H. Homotopy method for the numerical solution of the eigenvalue problem of self-adjoint partial differential operators. Numer. Algorithms 10 (1995) 363-378
    • (1995) Numer. Algorithms , vol.10 , pp. 363-378
    • Lui, S.H.1    Golub, G.H.2
  • 103
    • 0031496956 scopus 로고    scopus 로고
    • Homotopy method for the large sparse real nonsymmetric eigenvalue problem
    • Lui S.H., Keller H.B., and Kwok W.C. Homotopy method for the large sparse real nonsymmetric eigenvalue problem. SIAM J. Matrix Anal. Appl. 18 2 (1997) 312-333
    • (1997) SIAM J. Matrix Anal. Appl. , vol.18 , Issue.2 , pp. 312-333
    • Lui, S.H.1    Keller, H.B.2    Kwok, W.C.3
  • 104
    • 0001256129 scopus 로고    scopus 로고
    • The Tchebychev iteration for nonsymmetric linear systems
    • Manteuffel T.A. The Tchebychev iteration for nonsymmetric linear systems. Numer. Math. 28 (1997) 307-327
    • (1997) Numer. Math. , vol.28 , pp. 307-327
    • Manteuffel, T.A.1
  • 105
    • 0002951313 scopus 로고    scopus 로고
    • Robust methods for the calculation of rightmost eigenvalues of nonsymmetric eigenvalue problems
    • Katholieke Universiteit Leuven, Leuven, Belgium
    • Meerbergen K. Robust methods for the calculation of rightmost eigenvalues of nonsymmetric eigenvalue problems. PhD thesis (1996), Katholieke Universiteit Leuven, Leuven, Belgium
    • (1996) PhD thesis
    • Meerbergen, K.1
  • 106
    • 4244189929 scopus 로고    scopus 로고
    • Locking and restarting quadratic eigenvalue solvers
    • Rutherford Appleton Laboratory, Oxon, England
    • Meerbergen K. Locking and restarting quadratic eigenvalue solvers. Technical Report RAL-TR-1999-011 (1999), Rutherford Appleton Laboratory, Oxon, England
    • (1999) Technical Report RAL-TR-1999-011
    • Meerbergen, K.1
  • 108
    • 0000356673 scopus 로고
    • An algorithm for generalized matrix eigenvalue problems
    • Moler C.B., and Stewart G.W. An algorithm for generalized matrix eigenvalue problems. SIAM J. Numer. Anal. 10 (1973) 241-256
    • (1973) SIAM J. Numer. Anal. , vol.10 , pp. 241-256
    • Moler, C.B.1    Stewart, G.W.2
  • 109
    • 0000965239 scopus 로고
    • Computing interior eigenvalues of large matrices
    • Morgan R.B. Computing interior eigenvalues of large matrices. Linear Algebra Appl. (1991) 154-156
    • (1991) Linear Algebra Appl. , pp. 154-156
    • Morgan, R.B.1
  • 110
    • 0000965239 scopus 로고
    • Computing interior eigenvalues of large matrices
    • Morgan R.B. Computing interior eigenvalues of large matrices. Linear Algebra Appl. (1991) 289-309
    • (1991) Linear Algebra Appl. , pp. 289-309
    • Morgan, R.B.1
  • 111
    • 0000115363 scopus 로고
    • Generalizations of Davidson's method for computing eigenvalues of large nonsymmetric matrices
    • Morgan R.B. Generalizations of Davidson's method for computing eigenvalues of large nonsymmetric matrices. J. Comp. Phys. 101 (1992) 287-291
    • (1992) J. Comp. Phys. , vol.101 , pp. 287-291
    • Morgan, R.B.1
  • 112
    • 0001398614 scopus 로고
    • Generalizations of Davidson's method for computing eigenvalues of sparse symmetric matrices
    • Morgan R.B., and Scott D.S. Generalizations of Davidson's method for computing eigenvalues of sparse symmetric matrices. SIAM J. Sci. Statist. Comput. 7 3 (1986) 817-825
    • (1986) SIAM J. Sci. Statist. Comput. , vol.7 , Issue.3 , pp. 817-825
    • Morgan, R.B.1    Scott, D.S.2
  • 113
    • 0000888517 scopus 로고
    • Preconditioning the Lanczos algorithm for sparse symmetric eigenvalue problems
    • Morgan R.B., and Scott D.S. Preconditioning the Lanczos algorithm for sparse symmetric eigenvalue problems. SIAM J. Sci. Comput. 14 (1993) 585-593
    • (1993) SIAM J. Sci. Comput. , vol.14 , pp. 585-593
    • Morgan, R.B.1    Scott, D.S.2
  • 114
    • 84957864325 scopus 로고    scopus 로고
    • Parallel Jacobi-Davidson for solving generalized eigenvalue problems
    • Vector and Parallel Processing - VECPAR'98. Palma J.M.L.M., Dongarra J., and Hernández V. (Eds), Springer Verlag, Berlin
    • Nool M., and van der Ploeg A. Parallel Jacobi-Davidson for solving generalized eigenvalue problems. In: Palma J.M.L.M., Dongarra J., and Hernández V. (Eds). Vector and Parallel Processing - VECPAR'98. Lecture Notes in Comput. Sci. 1573 (1999), Springer Verlag, Berlin 58-70
    • (1999) Lecture Notes in Comput. Sci. 1573 , pp. 58-70
    • Nool, M.1    van der Ploeg, A.2
  • 115
    • 0001742428 scopus 로고
    • Passing the one-billion limit in full configuration-interaction (FCI) calculations
    • Olsen J., JØrgensen P., and Simons J. Passing the one-billion limit in full configuration-interaction (FCI) calculations. Chem. Phys. Lett. 169 (1990) 463-472
    • (1990) Chem. Phys. Lett. , vol.169 , pp. 463-472
    • Olsen, J.1    JØrgensen, P.2    Simons, J.3
  • 117
    • 34250951234 scopus 로고
    • On the convergence of the Rayleigh quotient iteration for the computation of characteristic roots and vectors. I
    • Ostrowski A.M. On the convergence of the Rayleigh quotient iteration for the computation of characteristic roots and vectors. I. Arch. Rational Mesh. Anal. 1 (1958) 233-241
    • (1958) Arch. Rational Mesh. Anal. , vol.1 , pp. 233-241
    • Ostrowski, A.M.1
  • 118
    • 0038876090 scopus 로고
    • On the convergence of the Rayleigh quotient iteration for the computation of characteristic roots and vectors. V
    • Ostrowski A.M. On the convergence of the Rayleigh quotient iteration for the computation of characteristic roots and vectors. V. Arch. Rational Mesh. Anal. 3 (1959) 472-481
    • (1959) Arch. Rational Mesh. Anal. , vol.3 , pp. 472-481
    • Ostrowski, A.M.1
  • 119
    • 0005637341 scopus 로고
    • An eigenvalue algorithm for skew symmetric matrices
    • Paardekooper M.H.C. An eigenvalue algorithm for skew symmetric matrices. Numer. Math. 17 (1971) 189-202
    • (1971) Numer. Math. , vol.17 , pp. 189-202
    • Paardekooper, M.H.C.1
  • 120
    • 0003761695 scopus 로고
    • The computation of eigenvalues and eigenvectors of very large matrices
    • Univ. of London
    • Paige C.C. The computation of eigenvalues and eigenvectors of very large matrices. PhD thesis (1971), Univ. of London
    • (1971) PhD thesis
    • Paige, C.C.1
  • 121
    • 72449139170 scopus 로고
    • Computational variants of the Lanczos method for the eigenproblem
    • Paige C.C. Computational variants of the Lanczos method for the eigenproblem. J. Inst. Math. Appl. 10 (1972) 373-381
    • (1972) J. Inst. Math. Appl. , vol.10 , pp. 373-381
    • Paige, C.C.1
  • 122
    • 53849148874 scopus 로고
    • Error analysis of the Lanczos algorithm for tridiagonalizing a symmetric matrix
    • Paige C.C. Error analysis of the Lanczos algorithm for tridiagonalizing a symmetric matrix. J. Inst. Math. Appl. 18 (1976) 341-349
    • (1976) J. Inst. Math. Appl. , vol.18 , pp. 341-349
    • Paige, C.C.1
  • 123
    • 84985350406 scopus 로고
    • Approximate solutions and eigenvalue bounds from Krylov subspaces
    • Paige C.C., Parlett B.N., and van der Vorst H.A. Approximate solutions and eigenvalue bounds from Krylov subspaces. Num. Linear Algebra Appl. 2 2 (1995) 115-134
    • (1995) Num. Linear Algebra Appl. , vol.2 , Issue.2 , pp. 115-134
    • Paige, C.C.1    Parlett, B.N.2    van der Vorst, H.A.3
  • 124
    • 0016555955 scopus 로고
    • Solution of sparse indefinite systems of linear equations
    • Paige C.C., and Saunders M.A. Solution of sparse indefinite systems of linear equations. SIAM J. Numer. Anal. 12 (1975) 617-629
    • (1975) SIAM J. Numer. Anal. , vol.12 , pp. 617-629
    • Paige, C.C.1    Saunders, M.A.2
  • 126
    • 0039287072 scopus 로고
    • Misconvergence in the Lanczos algorithm
    • Cox M.G., and Hammarling S. (Eds), Clarendon Press, Oxford, UK Chapter 1
    • Parlett B.N. Misconvergence in the Lanczos algorithm. In: Cox M.G., and Hammarling S. (Eds). Reliable Numerical Computation (1990), Clarendon Press, Oxford, UK Chapter 1
    • (1990) Reliable Numerical Computation
    • Parlett, B.N.1
  • 127
    • 84968487118 scopus 로고
    • The Lanczos algorithm with selective orthogonalization
    • Parlett B.N., and Scott D.S. The Lanczos algorithm with selective orthogonalization. Math. Comp. 33 (1979) 217-238
    • (1979) Math. Comp. , vol.33 , pp. 217-238
    • Parlett, B.N.1    Scott, D.S.2
  • 128
    • 84966231631 scopus 로고
    • A look-ahead Lanczos algorithm for unsymmetric matrices
    • Parlett B.N., Taylor D.R., and Liu Z.A. A look-ahead Lanczos algorithm for unsymmetric matrices. Math. Comp. 44 (1985) 105-124
    • (1985) Math. Comp. , vol.44 , pp. 105-124
    • Parlett, B.N.1    Taylor, D.R.2    Liu, Z.A.3
  • 129
    • 32644449251 scopus 로고
    • Parallel subspace method for non-Hermitian eigenproblems on the Connection Machine (CM2)
    • Petition S.G. Parallel subspace method for non-Hermitian eigenproblems on the Connection Machine (CM2). Appl. Numer. Math. 10 (1992) 19-36
    • (1992) Appl. Numer. Math. , vol.10 , pp. 19-36
    • Petition, S.G.1
  • 130
    • 0039878919 scopus 로고
    • Maximizing functions of rotations: experiments concerning speed of diagonalization of symmetric matrices using Jacobi's method
    • Pope D.A., and Tompkins C. Maximizing functions of rotations: experiments concerning speed of diagonalization of symmetric matrices using Jacobi's method. J. ACM 4 (1957) 459-466
    • (1957) J. ACM , vol.4 , pp. 459-466
    • Pope, D.A.1    Tompkins, C.2
  • 131
    • 0000219783 scopus 로고
    • Algorithms for the nonlinear eigenvalue problem
    • Ruhe A. Algorithms for the nonlinear eigenvalue problem. SIAM J. Numer. Anal. 10 (1973) 674-689
    • (1973) SIAM J. Numer. Anal. , vol.10 , pp. 674-689
    • Ruhe, A.1
  • 132
    • 84968508607 scopus 로고
    • Implementation aspects of band Lanczos algorithms for computation of eigenvalues of large sparse symmetric matrices
    • Ruhe A. Implementation aspects of band Lanczos algorithms for computation of eigenvalues of large sparse symmetric matrices. Math. Comput. 33 (1979) 680-687
    • (1979) Math. Comput. , vol.33 , pp. 680-687
    • Ruhe, A.1
  • 133
    • 0001409002 scopus 로고
    • The rational Krylov algorithm for nonsymmetric eigenvalue problems. III: Complex shifts for real matrices
    • Ruhe A. The rational Krylov algorithm for nonsymmetric eigenvalue problems. III: Complex shifts for real matrices. BIT 34 (1994) 165-176
    • (1994) BIT , vol.34 , pp. 165-176
    • Ruhe, A.1
  • 134
    • 43949153380 scopus 로고
    • Rational Krylov algorithms for nonsymmetric eigenvalue problems. II. Matrix pairs
    • Ruhe A. Rational Krylov algorithms for nonsymmetric eigenvalue problems. II. Matrix pairs. Linear Algebra Appl. 197/198 (1994) 283-295
    • (1994) Linear Algebra Appl. , vol.197-198 , pp. 283-295
    • Ruhe, A.1
  • 135
    • 0000767453 scopus 로고
    • On the rates of convergence of the Lanczos and block Lanczos methods
    • Saad Y. On the rates of convergence of the Lanczos and block Lanczos methods. SIAM J. Numer. Anal. 17 (1980) 687-706
    • (1980) SIAM J. Numer. Anal. , vol.17 , pp. 687-706
    • Saad, Y.1
  • 137
    • 0000048673 scopus 로고
    • GMRES: a generalized minimal residual algorithm for solving nonsymmetric linear systems
    • Saad Y., and Schultz M.H. GMRES: a generalized minimal residual algorithm for solving nonsymmetric linear systems. SIAM J. Sci. Statist. Comput. 7 (1986) 856-869
    • (1986) SIAM J. Sci. Statist. Comput. , vol.7 , pp. 856-869
    • Saad, Y.1    Schultz, M.H.2
  • 138
    • 84968513725 scopus 로고
    • On Jacobi and Jacobi-like algorithms for a parallel computer
    • Sameh A. On Jacobi and Jacobi-like algorithms for a parallel computer. Math. Comp. 25 (1971) 579-590
    • (1971) Math. Comp. , vol.25 , pp. 579-590
    • Sameh, A.1
  • 139
    • 4243810288 scopus 로고
    • Zur Konvergenz des Jacobi-Verfahrens
    • Schönhage A. Zur Konvergenz des Jacobi-Verfahrens. Numer. Math. 3 (1961) 374-380
    • (1961) Numer. Math. , vol.3 , pp. 374-380
    • Schönhage, A.1
  • 140
    • 1542498668 scopus 로고    scopus 로고
    • Jacobi-Davidson type methods for generalized eigenproblems and polynomial eigenproblems
    • Sleijpen G.L.G., Booten J.G.L., Fokkema D.R., and van der Vorst H.A. Jacobi-Davidson type methods for generalized eigenproblems and polynomial eigenproblems. BIT 36 (1996) 595-633
    • (1996) BIT , vol.36 , pp. 595-633
    • Sleijpen, G.L.G.1    Booten, J.G.L.2    Fokkema, D.R.3    van der Vorst, H.A.4
  • 141
    • 21444444506 scopus 로고    scopus 로고
    • Further results on the convergence behavior of Conjugate-Gradients and Ritz values
    • Sleijpen G.L.G., and van der Sluis A. Further results on the convergence behavior of Conjugate-Gradients and Ritz values. Linear Algebra Appl. 246 (1996) 233-278
    • (1996) Linear Algebra Appl. , vol.246 , pp. 233-278
    • Sleijpen, G.L.G.1    van der Sluis, A.2
  • 142
    • 0030560293 scopus 로고    scopus 로고
    • A Jacobi-Davidson iteration method for linear eigenvalue problems
    • Sleijpen G.L.G., and van der Vorst H.A. A Jacobi-Davidson iteration method for linear eigenvalue problems. SIAM J. Matrix Anal. Appl. 17 (1996) 401-425
    • (1996) SIAM J. Matrix Anal. Appl. , vol.17 , pp. 401-425
    • Sleijpen, G.L.G.1    van der Vorst, H.A.2
  • 143
    • 1642279355 scopus 로고    scopus 로고
    • The Jacobi-Davidson method for eigenproblems and its relation with accelerated inexact Newton schemes
    • Margenov S.D., and Vassilevski P.S. (Eds). Blagoevgrad, June 17-21, 1995 (North-Holland, Amsterdam)
    • Sleijpen G.L.G., and van der Vorst H.A. The Jacobi-Davidson method for eigenproblems and its relation with accelerated inexact Newton schemes. In: Margenov S.D., and Vassilevski P.S. (Eds). Iterative methods in Linear Algebra II, Proceedings of the Second IMACS International Symposium. Blagoevgrad, June 17-21, 1995 (1996) (North-Holland, Amsterdam)
    • (1996) Iterative methods in Linear Algebra II, Proceedings of the Second IMACS International Symposium
    • Sleijpen, G.L.G.1    van der Vorst, H.A.2
  • 144
    • 0001917562 scopus 로고    scopus 로고
    • Efficient expansion of subspaces in the Jacobi-Davidson method for standard and generalized eigenproblems
    • Sleijpen G.L.G., van der Vorst H.A., and Meijerink E. Efficient expansion of subspaces in the Jacobi-Davidson method for standard and generalized eigenproblems. ETNA 7 (1998) 75-89
    • (1998) ETNA , vol.7 , pp. 75-89
    • Sleijpen, G.L.G.1    van der Vorst, H.A.2    Meijerink, E.3
  • 146
    • 0000322706 scopus 로고
    • Implicit application of polynomial filters in a k-step Arnoldi method
    • Sorensen D.C. Implicit application of polynomial filters in a k-step Arnoldi method. SIAM J. Matrix Anal. Appl. 13 1 (1992) 357-385
    • (1992) SIAM J. Matrix Anal. Appl. , vol.13 , Issue.1 , pp. 357-385
    • Sorensen, D.C.1
  • 147
    • 0015482839 scopus 로고
    • On the sensitivity of the eigenvalue problem Ax = λBx
    • Stewart G.W. On the sensitivity of the eigenvalue problem Ax = λBx. SIAM J. Numer. Anal. 9 (1972) 669-686
    • (1972) SIAM J. Numer. Anal. , vol.9 , pp. 669-686
    • Stewart, G.W.1
  • 148
    • 0001959784 scopus 로고
    • Perturbation theory for the generalized eigenvalue problem
    • de Boor C., and Golubs G.H. (Eds), Academic Press, New York
    • Stewart G.W. Perturbation theory for the generalized eigenvalue problem. In: de Boor C., and Golubs G.H. (Eds). Recent Advances in Numerical Analysis (1978), Academic Press, New York
    • (1978) Recent Advances in Numerical Analysis
    • Stewart, G.W.1
  • 150
    • 67649355869 scopus 로고    scopus 로고
    • Perturbation analysis of quadratic eigenvalue problems
    • Dept. Computer Science, Ume» University, Sweden
    • Sun J.-G. Perturbation analysis of quadratic eigenvalue problems. Technical Report UNINF 99.01 (1999), Dept. Computer Science, Ume» University, Sweden
    • (1999) Technical Report UNINF 99.01
    • Sun, J.-G.1
  • 151
    • 67649309648 scopus 로고
    • Amer. Math. Soc., New York
    • Szegö G. Orthogonal Polynomials. 3rd edn. Colloq. Publ. No. 23 (1967), Amer. Math. Soc., New York
    • (1967) Colloq. Publ. No. 23
    • Szegö, G.1
  • 152
    • 0000004244 scopus 로고
    • A recurring theorem on determinants
    • Taussky O. A recurring theorem on determinants. Amer. Math. Monthly 56 (1949) 672-676
    • (1949) Amer. Math. Monthly , vol.56 , pp. 672-676
    • Taussky, O.1
  • 153
    • 0003820738 scopus 로고
    • Analysis of the look ahead Lanczos algorithm
    • University of California, Berkeley, CA
    • Taylor D.R. Analysis of the look ahead Lanczos algorithm. PhD thesis (1982), University of California, Berkeley, CA
    • (1982) PhD thesis
    • Taylor, D.R.1
  • 154
    • 0008477857 scopus 로고
    • The accuracy of Raleigh's method of calculating the natural frequencies of vibrating systems
    • Temple G. The accuracy of Raleigh's method of calculating the natural frequencies of vibrating systems. Proc. Roy. Soc. A 211 (1952) 204-224
    • (1952) Proc. Roy. Soc. A , vol.211 , pp. 204-224
    • Temple, G.1
  • 155
    • 0039878909 scopus 로고    scopus 로고
    • Backward error and condition of polynomial eigenvalue problems
    • University of Manchester, Manchester, UK
    • Tisseur F. Backward error and condition of polynomial eigenvalue problems. Technical Report NA-332 (1998), University of Manchester, Manchester, UK
    • (1998) Technical Report NA-332
    • Tisseur, F.1
  • 156
    • 0033293693 scopus 로고    scopus 로고
    • A parallel divide and conquer algorithm for the symmetric eigenvalue problem on distributed memory architectures
    • Tisseur F., and Dongarra J. A parallel divide and conquer algorithm for the symmetric eigenvalue problem on distributed memory architectures. SIAM J. Sci. Comput. 20 6 (1999) 2223-2236
    • (1999) SIAM J. Sci. Comput. , vol.20 , Issue.6 , pp. 2223-2236
    • Tisseur, F.1    Dongarra, J.2
  • 157
    • 0001953835 scopus 로고    scopus 로고
    • Calculation of the pseudospectra by the Arnoldi method
    • Toh K.-C., and Trefethen L.N. Calculation of the pseudospectra by the Arnoldi method. SIAM J. Sci. Comput. 17 (1996) 1-15
    • (1996) SIAM J. Sci. Comput. , vol.17 , pp. 1-15
    • Toh, K.-C.1    Trefethen, L.N.2
  • 158
    • 0000992781 scopus 로고
    • Pseudospectra of matrices
    • Griffiths D.F., and Watson G.A. (Eds), Longman, New York
    • Trefethen L.N. Pseudospectra of matrices. In: Griffiths D.F., and Watson G.A. (Eds). Numerical Analysis 1991 (1992), Longman, New York 234-266
    • (1992) Numerical Analysis 1991 , pp. 234-266
    • Trefethen, L.N.1
  • 159
    • 85011519633 scopus 로고    scopus 로고
    • Computation of pseudospectra
    • Trefethen L.N. Computation of pseudospectra. Acta Numer. 8 (1999) 247-295
    • (1999) Acta Numer. , vol.8 , pp. 247-295
    • Trefethen, L.N.1
  • 160
    • 0023433933 scopus 로고
    • An instability phenomenon in spectral methods
    • Trefethen L.N., and Trummer M.R. An instability phenomenon in spectral methods. SIAM J. Numer. Anal. 24 (1987) 1008-1023
    • (1987) SIAM J. Numer. Anal. , vol.24 , pp. 1008-1023
    • Trefethen, L.N.1    Trummer, M.R.2
  • 162
    • 0001403122 scopus 로고
    • The rate of convergence of conjugate gradients
    • van der Sluis A., and van der Vorst H.A. The rate of convergence of conjugate gradients. Numer. Math. 48 (1986) 543-560
    • (1986) Numer. Math. , vol.48 , pp. 543-560
    • van der Sluis, A.1    van der Vorst, H.A.2
  • 163
    • 38249033965 scopus 로고
    • The convergence behavior of Ritz values in the presence of close eigenvalues
    • van der Sluis A., and van der Vorst H.A. The convergence behavior of Ritz values in the presence of close eigenvalues. Linear Algebra Appl. 88/89 (1987) 651-694
    • (1987) Linear Algebra Appl. , vol.88-89 , pp. 651-694
    • van der Sluis, A.1    van der Vorst, H.A.2
  • 164
    • 0023519906 scopus 로고
    • Numerical solution of large sparse linear algebraic systems arising from tomographic problems
    • Nolet G. (Ed), Reidel Pub. Comp., Dordrecht Chapter 3
    • van der Sluis A., and van der Vorst H.A. Numerical solution of large sparse linear algebraic systems arising from tomographic problems. In: Nolet G. (Ed). Seismic Tomography (1987), Reidel Pub. Comp., Dordrecht 49-83 Chapter 3
    • (1987) Seismic Tomography , pp. 49-83
    • van der Sluis, A.1    van der Vorst, H.A.2
  • 165
    • 84966237838 scopus 로고
    • A generalized Lanczos scheme
    • van der Vorst H.A. A generalized Lanczos scheme. Math. Comp. 39 160 (1982) 559-561
    • (1982) Math. Comp. , vol.39 , Issue.160 , pp. 559-561
    • van der Vorst, H.A.1
  • 166
    • 0002302093 scopus 로고    scopus 로고
    • 150 Years old and still alive: Eigenproblems
    • Duff I.S., and Watson G.A. (Eds), Clarendon Press, Oxford
    • van der Vorst H.A., and Golub G.H. 150 Years old and still alive: Eigenproblems. In: Duff I.S., and Watson G.A. (Eds). The State of the Art in Numerical Analysis (1997), Clarendon Press, Oxford 93-119
    • (1997) The State of the Art in Numerical Analysis , pp. 93-119
    • van der Vorst, H.A.1    Golub, G.H.2
  • 167
    • 0000769280 scopus 로고
    • The computation of Kronecker's canonical form of a singular pencil
    • van Dooren P. The computation of Kronecker's canonical form of a singular pencil. Linear Algebra Appl. 27 (1979) 103-140
    • (1979) Linear Algebra Appl. , vol.27 , pp. 103-140
    • van Dooren, P.1
  • 168
    • 0019529778 scopus 로고
    • The generalized eigenstructure problem in linear system theory
    • Van Dooren P. The generalized eigenstructure problem in linear system theory. IEEE Trans. Auto. Cont. AC 26 (1981) 111-128
    • (1981) IEEE Trans. Auto. Cont. AC , vol.26 , pp. 111-128
    • Van Dooren, P.1
  • 169
    • 0000669144 scopus 로고
    • A generalized eigenvalue approach of solving Ricatti equations
    • Van Dooren P. A generalized eigenvalue approach of solving Ricatti equations. SIAM J. Sci. Statist. Comput. 2 (1981) 121-135
    • (1981) SIAM J. Sci. Statist. Comput. , vol.2 , pp. 121-135
    • Van Dooren, P.1
  • 170
    • 84976789456 scopus 로고
    • Algorithm 590, DUSBSP and EXCHQZZ: FORTRAN subroutines for computing deflating subspaces with specified spectrum
    • Van Dooren P. Algorithm 590, DUSBSP and EXCHQZZ: FORTRAN subroutines for computing deflating subspaces with specified spectrum. ACM Trans. Math. Software 8 (1982) 376-382
    • (1982) ACM Trans. Math. Software , vol.8 , pp. 376-382
    • Van Dooren, P.1
  • 171
    • 0041037295 scopus 로고
    • On quadratic convergence of the special cyclic Jacobi method
    • van Kempen H.P.M. On quadratic convergence of the special cyclic Jacobi method. Numer. Math. 9 (1966) 19-22
    • (1966) Numer. Math. , vol.9 , pp. 19-22
    • van Kempen, H.P.M.1
  • 173
    • 0000043097 scopus 로고
    • Implementation of the GMRES method using Householder transformations
    • Walker H.F. Implementation of the GMRES method using Householder transformations. SIAM J. Sci. Statist. Comput. 9 (1988) 152-163
    • (1988) SIAM J. Sci. Statist. Comput. , vol.9 , pp. 152-163
    • Walker, H.F.1
  • 175
    • 0027657519 scopus 로고
    • Some perspectives on the eigenvalue problem
    • Watkins D.S. Some perspectives on the eigenvalue problem. SIAM Rev. 35 (1993) 430-471
    • (1993) SIAM Rev. , vol.35 , pp. 430-471
    • Watkins, D.S.1
  • 176
    • 67649350875 scopus 로고    scopus 로고
    • QR-like algorithms for eigenvalue problems
    • to appear
    • Watkins D.S. QR-like algorithms for eigenvalue problems. J. Comp. Appl. Math. (2001) to appear
    • (2001) J. Comp. Appl. Math.
    • Watkins, D.S.1
  • 177
    • 0000630233 scopus 로고
    • Chasing algorithms for the eigenvalue problem
    • Watkins D.S., and Elsner L. Chasing algorithms for the eigenvalue problem. SIAM J. Matrix Anal. Appl. 12 (1991) 374-384
    • (1991) SIAM J. Matrix Anal. Appl. , vol.12 , pp. 374-384
    • Watkins, D.S.1    Elsner, L.2
  • 179
    • 0000318599 scopus 로고
    • Linear differential equations and Kronecker's canonical form
    • de Boor C., and Golub G.H. (Eds), Academic Press, New York
    • Wilkinson J.H. Linear differential equations and Kronecker's canonical form. In: de Boor C., and Golub G.H. (Eds). Recent Advances in Numerical Analysis (1978), Academic Press, New York 231-265
    • (1978) Recent Advances in Numerical Analysis , pp. 231-265
    • Wilkinson, J.H.1
  • 180
    • 0040876964 scopus 로고
    • Kronecker's canonical form and the QZ algorithm
    • Wilkinson J.H. Kronecker's canonical form and the QZ algorithm. Linear Algebra Appl. 28 (1979) 285-303
    • (1979) Linear Algebra Appl. , vol.28 , pp. 285-303
    • Wilkinson, J.H.1
  • 181
    • 0039877633 scopus 로고
    • Eigenvalue problems
    • Iserles A., and Powell M.J.D. (Eds), Clarendon Press, Oxford
    • Wilkinson J.H. Eigenvalue problems. In: Iserles A., and Powell M.J.D. (Eds). The State of the Art in Numerical Analysis (1987), Clarendon Press, Oxford 1-39
    • (1987) The State of the Art in Numerical Analysis , pp. 1-39
    • Wilkinson, J.H.1
  • 182
    • 0002626016 scopus 로고
    • Handbook for Automatic Computation
    • J.H. W., and Reinsch C. (Eds), Springer Verlag, Heidelberg - Berlin - New York
    • Handbook for Automatic Computation. In: J.H. W., and Reinsch C. (Eds). Linear Algebra Vol. 2 (1971), Springer Verlag, Heidelberg - Berlin - New York
    • (1971) Linear Algebra , vol.2
  • 183
    • 0039287052 scopus 로고    scopus 로고
    • On the homotopy method for symmetric modified generalized eigenvalue problems
    • Zhang T., Law K.H., and Golub G.H. On the homotopy method for symmetric modified generalized eigenvalue problems. SIAM J. Numer. Anal. 35 (1998) 300-319
    • (1998) SIAM J. Numer. Anal. , vol.35 , pp. 300-319
    • Zhang, T.1    Law, K.H.2    Golub, G.H.3


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