메뉴 건너뛰기




Volumn 34, Issue 6, 2012, Pages

Toward a high performance tile divide and conquer algorithm for the dense symmetric eigenvalue problem

Author keywords

Divide and conquer; Dynamic scheduling; Symmetric eigenvalue solver; Tile algorithms

Indexed keywords

SOFTWARE ARCHITECTURE;

EID: 84871558201     PISSN: 10648275     EISSN: 10957200     Source Type: Journal    
DOI: 10.1137/110823699     Document Type: Article
Times cited : (18)

References (45)
  • 3
    • 0026931028 scopus 로고
    • Divide and conquer algorithms for the band symmetric eigenvalue problem
    • P. Arbenz, Divide and conquer algorithms for the band symmetric eigenvalue problem, Parallel Comput., 18 (1992), pp. 1105-1128
    • (1992) Parallel Comput. , vol.18 , pp. 1105-1128
    • Arbenz, P.1
  • 4
    • 0012103078 scopus 로고
    • Restricted rank modification of the symmetric eigenvalue problem: Theoretical considerations
    • P. Arbenz, W. Gander, and G. H. Golub, Restricted rank modification of the symmetric eigenvalue problem: Theoretical considerations, Linear Algebra Appl., 104 (1988), pp. 75- 95
    • (1988) Linear Algebra Appl. , vol.104 , pp. 75-95
    • Arbenz, P.1    Gander, W.2    Golub, G.H.3
  • 5
    • 0002931349 scopus 로고
    • On the spectral decomposition of hermitian matrices modified by low rank perturbations with applications
    • P. Arbenz and G. H. Golub, On the spectral decomposition of Hermitian matrices modified by low rank perturbations with applications, SIAM J. Matrix Anal. Appl., 9 (1988), pp. 40-58
    • (1988) SIAM J. Matrix Anal. Appl. , vol.9 , pp. 40-58
    • Arbenz, P.1    Golub, G.H.2
  • 6
    • 34548283447 scopus 로고    scopus 로고
    • A parallel symmetric block-tridiagonal divide-and-conquer algorithm
    • Y. Bai and R. C. Ward, A parallel symmetric block-tridiagonal divide-and-conquer algorithm, ACM Trans. Math. Softw., 33 (2007), 25
    • (2007) ACM Trans. Math. Softw. , vol.33 , pp. 25
    • Bai, Y.1    Ward, R.C.2
  • 7
    • 0012881041 scopus 로고    scopus 로고
    • Algorithm 807: The SBR toolbox-software for successive band reduction
    • C. H. Bischof, B. Lang, and X. Sun, Algorithm 807: The SBR toolbox - software for successive band reduction, ACM Trans. Math. Softw., 26 (2000), pp. 602-616
    • (2000) ACM Trans. Math. Softw. , vol.26 , pp. 602-616
    • Bischof, C.H.1    Lang, B.2    Sun, X.3
  • 8
    • 0002316189 scopus 로고
    • Rank-one modification of the symmetric eigenproblem
    • J. R. Bunch, C. P. Nielsen, and D. C. Sorensen, Rank-one modification of the symmetric eigenproblem, Numer. Math., 31 (1978), pp. 31-48
    • (1978) Numer. Math. , vol.31 , pp. 31-48
    • Bunch, J.R.1    Nielsen, C.P.2    Sorensen, D.C.3
  • 9
    • 58149269099 scopus 로고    scopus 로고
    • A class of parallel tiled linear algebra algorithms for multicore architectures
    • A. Buttari, J. Langou, J. Kurzak, and J. Dongarra, A class of parallel tiled linear algebra algorithms for multicore architectures, Parallel Comput., 35 (2009), pp. 38-53
    • (2009) Parallel Comput. , vol.35 , pp. 38-53
    • Buttari, A.1    Langou, J.2    Kurzak, J.3    Dongarra, J.4
  • 10
    • 58149269099 scopus 로고    scopus 로고
    • A class of parallel tiled linear algebra algorithms for multicore architectures
    • A. Buttari, J. Langou, J. Kurzak, and J. J. Dongarra, A class of parallel tiled linear algebra algorithms for multicore architectures, Parallel Comput. Syst. Appl., 35 (2009), pp. 38-53
    • (2009) Parallel Comput. Syst. Appl. , vol.35 , pp. 38-53
    • Buttari, A.1    Langou, J.2    Kurzak, J.3    Dongarra, J.J.4
  • 12
    • 0000659575 scopus 로고
    • A divide and conquer method for the symmetric eigenproblem
    • J. J. M. Cuppen, A divide and conquer method for the symmetric eigenproblem, Numer. Math., 36 (1981), pp. 177-195
    • (1981) Numer. Math. , vol.36 , pp. 177-195
    • Cuppen, J.J.M.1
  • 16
    • 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
  • 17
    • 33845548230 scopus 로고    scopus 로고
    • The design and implementation of the MRRR algorithm
    • I. S. Dhillon, B. N. Parlett, and C. Vömel, The design and implementation of the MRRR algorithm, ACM Trans. Math. Softw., 32 (2006), pp. 533-560
    • (2006) ACM Trans. Math. Softw. , vol.32 , pp. 533-560
    • Dhillon, I.S.1    Parlett, B.N.2    Vömel, C.3
  • 18
    • 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
  • 19
    • 0040609750 scopus 로고    scopus 로고
    • A low-complexity divide-and-conquer method for computing eigenvalues and eigenvectors of symmetric band matrices
    • W. N. Gansterer, J. Schneid, and C. Ueberhuber, A low-complexity divide-and-conquer method for computing eigenvalues and eigenvectors of symmetric band matrices, BIT, 41 (2001), pp. 967-976
    • (2001) BIT , vol.41 , pp. 967-976
    • Gansterer, W.N.1    Schneid, J.2    Ueberhuber, C.3
  • 20
    • 0040668385 scopus 로고    scopus 로고
    • An extension of the divide-and-conquer method for a class of symmetric block-tridiagonal eigenproblems
    • W. N. Gansterer, R. C. Ward, and R. P. Muller, An extension of the divide-and-conquer method for a class of symmetric block-tridiagonal eigenproblems, ACM Trans. Math. Softw., 28 (2002), pp. 45-58
    • (2002) ACM Trans. Math. Softw. , vol.28 , pp. 45-58
    • Gansterer, W.N.1    Ward, R.C.2    Muller, R.P.3
  • 21
    • 1842531885 scopus 로고    scopus 로고
    • Computing approximate eigenpairs of symmetric block tridiagonal matrices
    • W. N. Gansterer, R. C. Ward, R. P. Muller, and W. A. Goddard III, Computing approximate eigenpairs of symmetric block tridiagonal matrices, SIAM J. Sci. Comput., 25 (2003), pp. 65-85
    • (2003) SIAM J. Sci. Comput. , vol.25 , pp. 65-85
    • Gansterer, W.N.1    Ward, R.C.2    Muller, R.P.3    Goddard Iii, W.A.4
  • 23
    • 0001070999 scopus 로고
    • Some modified matrix eigenvalue problems
    • G. H. Golub, Some modified matrix eigenvalue problems, SIAM Rev., 15 (1973), pp. 318-334
    • (1973) SIAM Rev. , vol.15 , pp. 318-334
    • Golub, G.H.1
  • 24
    • 0004236492 scopus 로고    scopus 로고
    • 3rd ed., Johns Hopkins University Press, Baltimore, MD
    • G. H. Golub and C. F. Van Loan, Matrix Computations, 3rd ed., Johns Hopkins University Press, Baltimore, MD, 1996
    • (1996) Matrix Computations
    • Golub, G.H.1    Van Loan, C.F.2
  • 25
    • 0542421948 scopus 로고
    • The solution of large dense generalized eigenvalue problems on the Cray X-MP/24 with SSD
    • R. Grimes, H. Krakauer, J. Lewis, H. Simon, and S.-H. Wei, The solution of large dense generalized eigenvalue problems on the Cray X-MP/24 with SSD, J. Comput. Phys., 69 (1987), pp. 471-481
    • (1987) J. Comput. Phys. , vol.69 , pp. 471-481
    • Grimes, R.1    Krakauer, H.2    Lewis, J.3    Simon, H.4    Wei, S.-H.5
  • 26
    • 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
  • 27
    • 77957918414 scopus 로고    scopus 로고
    • Intel Math Kernel Library, http://www.intel.com/cd/software/products/ asmo-na/eng/ 307757.htm
    • Intel Math Kernel Library
  • 28
    • 0041544728 scopus 로고
    • Solving the symmetric tridiagonal eigenvalues problem on the hypercube
    • I. C. F. Ipsen and E. R. Jessup, Solving the symmetric tridiagonal eigenvalues problem on the hypercube, SIAM J. Sci. Statist. Comput., 11 (1990), pp. 203-229
    • (1990) SIAM J. Sci. Statist. Comput. , vol.11 , pp. 203-229
    • Ipsen, I.C.F.1    Jessup, E.R.2
  • 29
    • 49349111725 scopus 로고    scopus 로고
    • Solving systems of linear equations on the CELL processor using Cholesky factorization
    • J. Kurzak, A. Buttari, and J. J. Dongarra, Solving systems of linear equations on the CELL processor using Cholesky factorization, IEEE Trans. Parallel Distrib. Syst., 19 (2008), pp. 1-11
    • (2008) IEEE Trans. Parallel Distrib. Syst. , vol.19 , pp. 1-11
    • Kurzak, J.1    Buttari, A.2    Dongarra, J.J.3
  • 30
    • 78449238949 scopus 로고    scopus 로고
    • Fully dynamic scheduler for numerical scheduling on multicore processors
    • UT-CS-09-643, Innovative Computing Lab, University of Tennessee, Knoxville
    • J. Kurzak and J. Dongarra, Fully Dynamic Scheduler for Numerical Scheduling on Multicore Processors, LAPACK Working Note 220, UT-CS-09-643, Innovative Computing Lab, University of Tennessee, Knoxville, 2009
    • (2009) LAPACK Working Note 220
    • Kurzak, J.1    Dongarra, J.2
  • 31
    • 60649117581 scopus 로고    scopus 로고
    • QR factorization for the cell broadband engine
    • J. Kurzak and J. Dongarra, QR factorization for the cell broadband engine, Sci. Programming, 17 (2009), pp. 31-42
    • (2009) Sci. Programming , vol.17 , pp. 31-42
    • Kurzak, J.1    Dongarra, J.2
  • 32
    • 48849105175 scopus 로고    scopus 로고
    • Algorithm 880: A testing infrastructure for symmetric tridiagonal eigensolvers
    • O. A. Marques, C. Vömel, J. W. Demmel, and B. N. Parlett, Algorithm 880: A testing infrastructure for symmetric tridiagonal eigensolvers, ACM Trans. Math. Softw., 35 (2008), pp. 8:1-8:13
    • (2008) ACM Trans. Math. Softw. , vol.35 , pp. 81-813
    • Marques, O.A.1    Vömel, C.2    Demmel, J.W.3    Parlett, B.N.4
  • 38
    • 0039424334 scopus 로고
    • A serial implementation of Cuppen's divide and conquer algorithm for the symmetric eigenvalue problem
    • UT-CS-94-225, Department of Computer Science, University of Tennessee, Knoxville
    • J. Rutter, A Serial Implementation of Cuppen's Divide and Conquer Algorithm for the Symmetric Eigenvalue Problem, LAPACK Working Note 69, UT-CS-94-225, Department of Computer Science, University of Tennessee, Knoxville, 1994
    • (1994) LAPACK Working Note 69
    • Rutter, J.1
  • 39
    • 74049123996 scopus 로고    scopus 로고
    • Version 2.0, Barcelona Supercomputing Center
    • SMP Superscalar (SMPSs) User's Manual, Version 2.0, Barcelona Supercomputing Center, http://www.bsc.es/media/1002.pdf, 2008
    • (2008) SMP Superscalar (SMPSs) User's Manual
  • 40
    • 0026402822 scopus 로고
    • On the orthogonality of eigenvectors computed by divideand-conquer techniques
    • D. C. Sorensen and P. T. P. Tang, On the orthogonality of eigenvectors computed by divideand- conquer techniques, SIAM J. Numer. Anal., 28 (1991), pp. 1752-1775
    • (1991) SIAM J. Numer. Anal. , vol.28 , pp. 1752-1775
    • Sorensen, D.C.1    Tang, P.T.P.2
  • 41
    • 0016896723 scopus 로고
    • The behavior of eigenvalues and singular values under perturbations of restricted rank
    • R. C. Thompson, The behavior of eigenvalues and singular values under perturbations of restricted rank, Linear Algebra Appl., 13 (1976), pp. 69-78
    • (1976) Linear Algebra Appl. , vol.13 , pp. 69-78
    • Thompson, R.C.1
  • 42
    • 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가 분석하여 추출한 것입니다.