메뉴 건너뛰기




Volumn 27, Issue 1, 2005, Pages 43-66

A parallel eigensolver for dense symmetric matrices based on multiple relatively robust representations

Author keywords

Eigenvalues; Eigenvectors; Parallel computing; Relatively robust representations; Symmetric matrix

Indexed keywords

ALGORITHMS; MATRIX ALGEBRA; PARALLEL PROCESSING SYSTEMS; QUANTUM THEORY; ROBUSTNESS (CONTROL SYSTEMS);

EID: 33144474872     PISSN: 10648275     EISSN: None     Source Type: Journal    
DOI: 10.1137/030601107     Document Type: Article
Times cited : (42)

References (45)
  • 2
    • 11744267002 scopus 로고
    • Orbital invariant second order many-body perturbation on parallel computers: An approach for large molecules
    • D. BERNHOLDT AND R. HARRISON, Orbital invariant second order many-body perturbation on parallel computers: An approach for large molecules, J. Chem. Physics, 102 (1995), pp. 9582-9589.
    • (1995) J. Chem. Physics , vol.102 , pp. 9582-9589
    • Bernholdt, D.1    Harrison, R.2
  • 3
    • 0022602354 scopus 로고
    • Parallel implementation of bisection for the calculation of eigenvalues of tridiagonal symmetric matrices
    • H. J. BERNSTEIN AND M. GOLDSTEIN, Parallel implementation of bisection for the calculation of eigenvalues of tridiagonal symmetric matrices, Computing, 37 (1986), pp. 85-91.
    • (1986) Computing , vol.37 , pp. 85-91
    • Bernstein, H.J.1    Goldstein, M.2
  • 4
    • 33144477463 scopus 로고    scopus 로고
    • A parallel eigensolver for dense symmetric matrices based on multiple relatively robust representations
    • Department of Computer Sciences, University of Texas, Austin, TX
    • P. BIENTINESI, I. S. DHILLON, AND R. VAN DE GEIJN, A Parallel Eigensolver for Dense Symmetric Matrices Based on Multiple Relatively Robust Representations, Technical report TR-03-26, Department of Computer Sciences, University of Texas, Austin, TX, 2003.
    • (2003) Technical Report , vol.TR-03-26
    • Bientinesi, P.1    Dhillon, I.S.2    Van De Geijn, R.3
  • 6
    • 0001951009 scopus 로고
    • The WY representation for products of Householder matrices
    • C. BISCHOF AND C. VAN LOAN, The WY representation for products of Householder matrices, SIAM J. Sci. Statist. Comput., 8 (1987), pp. s2-s13.
    • (1987) SIAM J. Sci. Statist. Comput. , vol.8
    • Bischof, C.1    Van Loan, C.2
  • 10
    • 0000659575 scopus 로고
    • A divide and conquer method for the symmetric tridiagonal eigenproblem
    • J. J. M. CUPPEN, A divide and conquer method for the symmetric tridiagonal eigenproblem, Numer. Math., 36 (1981), pp. 177-195.
    • (1981) Numer. Math. , vol.36 , pp. 177-195
    • Cuppen, J.J.M.1
  • 11
    • 0038975426 scopus 로고
    • Finding a zero by means of successive linear interpolation
    • B. Dejon and P. Henrici, eds., Wiley-Interscience, New York
    • T. J. DEKKER, Finding a zero by means of successive linear interpolation, in Constructive Aspects of the Fundamental Theorem of Algebra, B. Dejon and P. Henrici, eds., Wiley-Interscience, New York, 1969, pp. 37-48.
    • (1969) Constructive Aspects of the Fundamental Theorem of Algebra , pp. 37-48
    • Dekker, T.J.1
  • 12
    • 21144468781 scopus 로고
    • Jacobi's method is more accurate than QR
    • J. DEMMEL AND K. VESELIĆ, Jacobi's method is more accurate than QR, SIAM J. Matrix Anal. Appl., 13 (1992), pp. 1204-1245.
    • (1992) SIAM J. Matrix Anal. Appl. , vol.13 , pp. 1204-1245
    • Demmel, J.1    Veselić, K.2
  • 13
    • 0008813715 scopus 로고    scopus 로고
    • 2) algorithm for the symmetric tridiagonal eigenvalue/eigenvector problem
    • Ph.D. thesis, Computer Science Division, University of California, Berkeley, CA
    • 2) Algorithm for the Symmetric Tridiagonal Eigenvalue/Eigenvector Problem, Ph.D. thesis, Computer Science Division, University of California, Berkeley, CA, 1997; available as UC Berkeley Technical report UCB//CSD-97-971.
    • (1997) UC Berkeley Technical Report , vol.UCB-CSD-97-971
    • Dhillon, I.S.1
  • 14
    • 0348229160 scopus 로고    scopus 로고
    • Current inverse iteration software can fail
    • I. S. DHILLON, Current inverse iteration software can fail, BIT, 38 (1998), pp. 685-704.
    • (1998) BIT , vol.38 , pp. 685-704
    • Dhillon, I.S.1
  • 16
    • 33144467012 scopus 로고    scopus 로고
    • Inner deflation for symmetric tridiagonal matrices
    • I. S. DHILLON AND A. N. MALYSHEV, Inner deflation for symmetric tridiagonal matrices, Linear Algebra Appl., 358 (2002), pp. 139-144.
    • (2002) Linear Algebra Appl. , vol.358 , pp. 139-144
    • Dhillon, S.1    Malyshev, A.N.2
  • 17
    • 2942522546 scopus 로고    scopus 로고
    • Multiple representations to compute orthogonal eigenvectors of symmetric tridiagonal matrices
    • I. S. DHILLON AND B. N. PARLETT, Multiple representations to compute orthogonal eigenvectors of symmetric tridiagonal matrices, Linear Algebra Appl., 387 (2004), pp. 1-28.
    • (2004) Linear Algebra Appl. , vol.387 , pp. 1-28
    • Dhillon, I.S.1    Parlett, B.N.2
  • 18
    • 2942514399 scopus 로고    scopus 로고
    • Orthogonal eigenvectors and relative gaps
    • I. S. DHILLON AND B. N. PARLETT, Orthogonal eigenvectors and relative gaps, SIAM J. Matrix Anal. Appl., 25 (2004), pp. 858-899.
    • (2004) SIAM J. Matrix Anal. Appl. , vol.25 , pp. 858-899
    • Dhillon, I.S.1    Parlett, B.N.2
  • 20
    • 0000417182 scopus 로고
    • A fully parallel algorithm for the symmetric eigenvalue problem
    • J. J. DONGARRA AND D. C. SORENSEN, A fully parallel algorithm for the symmetric eigenvalue problem, SIAM J. Sci. Statist. Comput., 8 (1987), pp. s139-s154.
    • (1987) SIAM J. Sci. Statist. Comput. , vol.8
    • Dongarra, J.J.1    Sorensen, D.C.2
  • 22
    • 0000257176 scopus 로고
    • Block reduction of matrices to condensed forms for eigenvalue computations
    • J. DONGARRA, S. J. HAMMARLING, AND D. C. SORENSEN, Block reduction of matrices to condensed forms for eigenvalue computations, J. Comput. Appl. Math., 27 (1989), pp. 215-227.
    • (1989) J. Comput. Appl. Math. , vol.27 , pp. 215-227
    • Dongarra, J.1    Hammarling, S.J.2    Sorensen, D.C.3
  • 24
    • 21344496407 scopus 로고
    • Accurate singular values and differential qd algorithms
    • K. FERNANDO AND B. PARLETT, Accurate singular values and differential qd algorithms, Numer. Math., 67 (1994), pp. 191-229.
    • (1994) Numer. Math. , vol.67 , pp. 191-229
    • Fernando, K.1    Parlett, B.2
  • 25
    • 0031536846 scopus 로고    scopus 로고
    • On computing an eigenvector of a tridiagonal matrix. Part I: Basic results
    • K. V. FERNANDO, On computing an eigenvector of a tridiagonal matrix. Part I: Basic results, SIAM J. Matrix Anal. Appl., 18 (1997), pp. 1013-1034.
    • (1997) SIAM J. Matrix Anal. Appl. , vol.18 , pp. 1013-1034
    • Fernando, K.V.1
  • 26
    • 0000394782 scopus 로고
    • The QR transformation: A unitary analogue to the LR transformation. I
    • G. J. F. FRANCIS, The QR transformation: A unitary analogue to the LR transformation. I, Comput. J., 4 (1961/1962), pp. 265-271.
    • (1961) Comput. J. , vol.4 , pp. 265-271
    • Francis, G.J.F.1
  • 27
    • 0000394779 scopus 로고
    • The QR transformation. II
    • G. J. F. FRANCIS The QR transformation. II, Comput. J., 4 (1961/1962), pp. 332-345.
    • (1961) Comput. J. , vol.4 , pp. 332-345
    • Francis, G.J.F.1
  • 28
    • 0004010233 scopus 로고
    • Numerical computation of the characteristic values of a real symmetric matrix
    • Oak Ridge National Laboratory, Oak Ridge, TN
    • W. J. GIVENS, Numerical Computation of the Characteristic Values of a Real Symmetric Matrix, Technical report ORNL-1574, Oak Ridge National Laboratory, Oak Ridge, TN, 1954.
    • (1954) Technical Report , vol.ORNL-1574
    • Givens, W.J.1
  • 29
    • 1542392269 scopus 로고    scopus 로고
    • On reducing TLB misses in matrix multiplication
    • Department of Computer Sciences, University of Texas, Austin, TX, 2002
    • K. GOTO AND R. A. VAN DE GEIJN, On Reducing TLB Misses in Matrix Multiplication, Technical report CS-TR-02-55, Department of Computer Sciences, University of Texas, Austin, TX, 2002; see also http://www.cs.utexas.edu/users/kgoto.
    • Technical Report , vol.CS-TR-02-55
    • Goto, K.1    Van Geijn, R.A.D.E.2
  • 30
    • 21844526695 scopus 로고
    • A divide-and-conquer algorithm for the symmetric tridiagonal eigenproblem
    • M. GU AND S. C. EISENSTAT, A divide-and-conquer algorithm for the symmetric tridiagonal eigenproblem, SIAM J. Matrix Anal. Appl., 16 (1995), pp. 172-191.
    • (1995) SIAM J. Matrix Anal. Appl. , vol.16 , pp. 172-191
    • Gu, M.1    Eisenstat, S.C.2
  • 32
    • 0032226427 scopus 로고    scopus 로고
    • Toward an efficient parallel eigensolver for dense symmetric matrices
    • B. HENDRICKSON, E. JESSUP, AND C. SMITH, Toward an efficient parallel eigensolver for dense symmetric matrices, SIAM J. Sci. Comput., 20 (1999), pp. 1132-1154.
    • (1999) SIAM J. Sci. Comput. , vol.20 , pp. 1132-1154
    • Hendrickson, B.1    Jessup, E.2    Smith, C.3
  • 33
    • 84868361941 scopus 로고
    • Concerning an easy process for solving equations occurring in the theory of secular disturbances
    • C. G. F. JACOBI, Concerning an easy process for solving equations occurring in the theory of secular disturbances, J. Reine Angew. Math., 30 (1846), pp. 51-94.
    • (1846) J. Reine Angew. Math. , vol.30 , pp. 51-94
    • Jacobi, C.G.F.1
  • 34
  • 36
    • 0039966628 scopus 로고
    • On some algorithms for the solution of the complete eigenvalue problem
    • V. N. KUBLANOVSKAYA, On some algorithms for the solution of the complete eigenvalue problem, Zh. Vych. Mat., 1 (1961), pp. 555-570.
    • (1961) Zh. Vych. Mat. , vol.1 , pp. 555-570
    • Kublanovskaya, V.N.1
  • 37
    • 0043268206 scopus 로고
    • The Laguerre iteration in solving the symmetric tridiagonal eigen-problem, revisited
    • T. Y. LI AND Z. G. ZENG, The Laguerre iteration in solving the symmetric tridiagonal eigen-problem, revisited, SIAM J. Sci. Statist. Comput., 15 (1994), pp. 1145-1173.
    • (1994) SIAM J. Sci. Statist. Comput. , vol.15 , pp. 1145-1173
    • Li, T.Y.1    Zeng, Z.G.2
  • 39
    • 84968516104 scopus 로고
    • Laguerre's method applied to the matrix eigenvalue problem
    • B. N. PARLETT, Laguerre's method applied to the matrix eigenvalue problem, Math. Comp., 18 (1964), pp. 464-485.
    • (1964) Math. Comp. , vol.18 , pp. 464-485
    • Parlett, B.N.1
  • 40
    • 0039504477 scopus 로고    scopus 로고
    • Fernando's solution to Wilkinson's problem: An application of double factorization
    • B. N. PARLETT AND I. S. DHILLON, Fernando's solution to Wilkinson's problem: An application of double factorization, Linear Algebra Appl., 267 (1997), pp. 247-279.
    • (1997) Linear Algebra Appl. , vol.267 , pp. 247-279
    • Parlett, B.N.1    Dhillon, I.S.2
  • 41
    • 0034421232 scopus 로고    scopus 로고
    • Relatively robust representations of symmetric tridiagonals
    • B. N. PARLETT AND I. S. DHILLON, Relatively robust representations of symmetric tridiagonals, Linear Algebra Appl., 309 (2000), pp. 121-151.
    • (2000) Linear Algebra Appl. , vol.309 , pp. 121-151
    • Parlett, B.N.1    Dhillon, I.S.2
  • 42
    • 0346498507 scopus 로고
    • The calculation of specified eigenvectors by inverse iteration, contribution II/18
    • Springer-Verlag, New York, Heidelberg, Berlin
    • G. PETERS AND J.H. WILKINSON, The calculation of specified eigenvectors by inverse iteration, contribution II/18, in Handbook of Automatic Computation, Vol. 2, Springer-Verlag, New York, Heidelberg, Berlin, 1971, pp. 418-439.
    • (1971) Handbook of Automatic Computation , vol.2 , pp. 418-439
    • Peters, G.1    Wilkinson, J.H.2
  • 43
    • 0033293693 scopus 로고    scopus 로고
    • A parallel divide and conquer algorithm for the symmetric eigenvalue problem on distributed memory architectures
    • F. TISSEUR AND J. DONGARRA, A parallel divide and conquer algorithm for the symmetric eigenvalue problem on distributed memory architectures, SIAM J. Sci. Comput., 20 (1999), pp. 2223-2236.
    • (1999) SIAM J. Sci. Comput. , vol.20 , pp. 2223-2236
    • Tisseur, F.1    Dongarra, J.2


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