메뉴 건너뛰기




Volumn 36, Issue 3, 2009, Pages

Anasazi software for the numerical solution of large-scale eigenvalue problems

Author keywords

Eigenvalue problems; Generic programming; Large scale scientific computing; Numerical algorithms; Object oriented programming

Indexed keywords

DESIGN AND DEVELOPMENT; EIGENSOLVER ALGORITHMS; EIGENSOLVERS; EIGENVALUE PROBLEM; EIGENVALUE PROBLEMS; FORTRAN 77; GENERIC PROGRAMMING; LARGE-SCALE SCIENTIFIC COMPUTING; NUMERICAL ALGORITHMS; NUMERICAL SOLUTION; PERFORMANCE COMPARISON; RESEARCH AND DEVELOPMENT; SOFTWARE PARADIGM; SOFTWARE PROJECT; TRILINOS;

EID: 70349739217     PISSN: 00983500     EISSN: 15577295     Source Type: Journal    
DOI: 10.1145/1527286.1527287     Document Type: Article
Times cited : (92)

References (37)
  • 1
    • 34548526602 scopus 로고    scopus 로고
    • Trust-region methods on Riemannian manifolds
    • ABSIL, P.-A., BAKER,C.G., AND GALLIVAN, K. A. 2007. Trust-region methods on Riemannian manifolds. Found. Comput. Math. 7, 3, 303-330.
    • (2007) Found. Comput. Math , vol.7 , Issue.3 , pp. 303-330
    • Absil, P.-A.1    Baker, C.G.2    Gallivan K. A3
  • 3
    • 24944533500 scopus 로고    scopus 로고
    • A comparison of eigensolvers for large-scale 3D modal analysis using AMG-preconditioned iterative methods
    • ARBENZ, P., HETMANIUK, U., LEHOUCQ, R., AND TUMINARO, R. 2005. A comparison of eigensolvers for large-scale 3D modal analysis using AMG-preconditioned iterative methods. Int. J. Numer. Meth. Engng. 64, 204-236.
    • (2005) Int. J. Numer. Meth. Engng , vol.64 , pp. 204-236
    • Arbenz, P.1    Hetmaniuk, U.2    Lehoucq, R.3    Tuminaro, R.4
  • 7
    • 70349735826 scopus 로고    scopus 로고
    • Tech. rep. SAND2004-3268. Sandia National Laboratories, Albugusberg
    • BARTLETT, R. A. 2004. Teuchos::RCP Beginner's Guide. Tech. rep. SAND2004-3268. Sandia National Laboratories, Albugusberg.
    • (2004) Teuchos::RCP Beginner's Guide
    • Bartlett, R.A.1
  • 10
    • 84966217951 scopus 로고
    • Reorthogonalization and stable algorithms for updating the Gram-Schmidt QR factorization
    • DANIEL, J., GRAGG, W. B., KAUFMAN, L., AND STEWART, G. W. 1976. Reorthogonalization and stable algorithms for updating the Gram-Schmidt QR factorization. Math. Computat. 30, 772-795.
    • (1976) Math. Computat , vol.30 , pp. 772-795
    • Daniel, J.1    Gragg, W.B.2    Kaufman, L.3    Stewart, G.W.4
  • 11
    • 0002368840 scopus 로고
    • Garbage collection and run-time typing as a C++ library
    • USENIX, pub-USENIX:adr
    • DETLEFS, D. 1992. Garbage collection and run-time typing as a C++ library. In Proceedings: USENIXC++ Technical Conference, USENIX, Ed. USENIX, pub-USENIX:adr, 37-56.
    • (1992) Proceedings: USENIXC++ Technical Conference, USENIX, Ed. , pp. 37-56
    • Detlefs, D.1
  • 12
    • 67349261452 scopus 로고    scopus 로고
    • Dynamical systems and non-Hermitian iterative eigensolvers
    • EMBREE,M. AND LEHOUCQ, R. B. 2007. Dynamical systems and non-Hermitian iterative eigensolvers. SIAM J. Numer. Anal. 47, 1445-1473, DOI 10.1137/07070187x.
    • (2007) SIAM J. Numer. Anal , vol.47 , pp. 1445-1473
    • Embree, M.1    Lehoucq, R.B.2
  • 18
    • 33748688428 scopus 로고    scopus 로고
    • Basis selection in LOBPCG
    • HETMANIUK,U. AND LEHOUCQ, R. 2006. Basis selection in LOBPCG. J. Comput. Phys. 218, 324-332.
    • (2006) J. Comput. Phys , vol.218 , pp. 324-332
    • Hetmaniuk, U.1    Lehoucq, R.2
  • 19
    • 0036223489 scopus 로고    scopus 로고
    • Toward the optimal preconditioned eigensolver: Locally optimal block preconditioned conjugate gradient method
    • KNYAZEV, A. V. 2001. Toward the optimal preconditioned eigensolver: Locally optimal block preconditioned conjugate gradient method. SIAM J. Sci. Comput. 23, 517-541.
    • (2001) SIAM J. Sci. Comput , vol.23 , pp. 517-541
    • Knyazev, A.V.1
  • 22
    • 0041522587 scopus 로고
    • Traits: A new and useful template technique
    • MEYERS, N. C. 1995. Traits: A new and useful template technique. C++ Rep. 7, 32-35.
    • (1995) C++ Rep , vol.7 , pp. 32-35
    • Meyers, N.C.1
  • 23
    • 0001398614 scopus 로고
    • Generalizations of Davidson's method for computing eigenvalues of sparse symmetric matrices
    • MORGAN,R.B. AND SCOTT, D. S. 1986. Generalizations of Davidson's method for computing eigenvalues of sparse symmetric matrices. SIAM J. Sci. Comput. 7, 817-825.
    • (1986) SIAM J. Sci. Comput , vol.7 , pp. 817-825
    • Morgan, R.B.1    Scott, D.S.2
  • 24
    • 0028463707 scopus 로고
    • Algorithm-oriented generic libraries
    • MUSSER,D.R. AND STEPANOV, A. A. 1994. Algorithm-oriented generic libraries. Softw. Pract. Ex- per. 24, 7, 623-642.
    • (1994) Softw. Pract. Ex- Per , vol.24 , Issue.7 , pp. 623-642
    • Musser, D.R.1    Stepanov, A.A.2
  • 26
    • 41149137044 scopus 로고    scopus 로고
    • Tech. rep. SAND2004-2189. Sandia National Laboratories, Albuquerque
    • SALA, M., HEROUX, M. A., AND DAY, D. M. 2004. Trilinos tutorial. Tech. rep. SAND2004-2189. Sandia National Laboratories, Albuquerque.
    • (2004) Trilinos Tutorial
    • Sala, M.1    Heroux, M.A.2    Day, D.M.3
  • 27
    • 21144435653 scopus 로고    scopus 로고
    • Bifurcation tracking algorithms and software for large-scale applications
    • SALINGER,A.G., BURROUGHS, E. A., PAWLOWSKI, R. P., PHIPPS,E.T., AND ROMERO, L. A. 2005. Bifurcation tracking algorithms and software for large-scale applications. Int. J. Bifurcat. Chaos 15, 1015-1032.
    • (2005) Int. J. Bifurcat. Chaos , vol.15 , pp. 1015-1032
    • Salinger, A.G.1    Burroughs, E.A.2    Phippse, P.P.R.3    Romero, L.A.4
  • 28
    • 0030560293 scopus 로고    scopus 로고
    • A Jacobi-Davidson iteration method for linear eigenvalue problems
    • SLEIJPEN,G.L.G. AND VAN DER VORST, H. A. 1996. A Jacobi-Davidson iteration method for linear eigenvalue problems. SIAM J. Matrix Anal. Appl. 17, 2, 401-425.
    • (1996) SIAM J. Matrix Anal. Appl. , vol.17 , Issue.2 , pp. 401-425
    • Sleijpen, G.L.G.1    Van Der Vorst, H.A.2
  • 30
    • 0000322706 scopus 로고
    • Implicit application of polynomial filters in a k -step Arnoldi method
    • SORENSEN, D. C. 1992. Implicit application of polynomial filters in a k -step Arnoldi method. SIAM J. Matrix Anal. Appl. 13, 357-385.
    • (1992) SIAM J. Matrix Anal. Appl. , vol.13 , pp. 357-385
    • Sorensen, D.C.1
  • 31
    • 70349742204 scopus 로고    scopus 로고
    • PRIMME home page
    • STATHOPOULOS,A. AND MCCOMBS, J. R. 2006. PRIMME home page. http://www.cs.wm.edu/~andreas/software/.
    • (2006)
    • Stathopoulos, A.1    McCombs, J.R.2
  • 32
    • 0036447603 scopus 로고    scopus 로고
    • A block orthogonalization procedure with constant synchronization requirements
    • STATHOPOULOS,A. AND WU, K. 2002. A block orthogonalization procedure with constant synchronization requirements. SIAM J. Sci. Comput. 23, 2165-2182.
    • (2002) SIAM J. Sci. Comput. , vol.23 , pp. 2165-2182
    • Stathopoulos, A.1    Wu, K.2
  • 33
    • 0036018626 scopus 로고    scopus 로고
    • A Krylov-Schur algorithm for large eigenproblems
    • STEWART, G. W. 2001a. A Krylov-Schur algorithm for large eigenproblems. SIAM J. Matrix Anal. Appl. 23, 601-614.
    • (2001) SIAM J. Matrix Anal. Appl. , vol.23 , pp. 601-614
    • Stewart, G.W.1
  • 35
    • 1342299960 scopus 로고    scopus 로고
    • Computational methods for large eigenvalue problems
    • P. Ciarlet and J. Lions, Eds. North-Holland (Elsevier), Amsterdam, The Netherlands
    • vAN DER VORST, H. A. 2002. Computational methods for large eigenvalue problems. In P. Ciarlet and J. Lions, Eds. Handbook of Numerical Analysis, vol.VIII. North-Holland (Elsevier), Amsterdam, The Netherlands, 3-179.
    • (2002) Handbook of Numerical Analysis , vol.8 , pp. 3-179
    • Van Der Vorst, H.A.1
  • 36
    • 33645149925 scopus 로고    scopus 로고
    • Addison-Wesley Longman Publishing Co., Inc., Reading
    • VANDEVOORDE,D. AND JOSUTTIS, N. M. 2002. C++ Templates. Addison-Wesley Longman Publishing Co., Inc., Reading.
    • (2002) C++ Templates
    • Vandevoorde, D.1    Josuttis, N.M.2


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