Abstract
Anasazi is a package within the Trilinos software project that provides a framework for the iterative, numerical solution of large-scale eigenvalue problems. Anasazi is written in ANSI C++ and exploits modern software paradigms to enable the research and development of eigensolver algorithms. Furthermore, Anasazi provides implementations for some of the most recent eigensolver methods. The purpose of our article is to describe the design and development of the Anasazi framework. A performance comparison of Anasazi and the popular FORTRAN 77 code ARPACK is given.
- Absil, P.-A., Baker, C. G., and Gallivan, K. A. 2007. Trust-region methods on Riemannian manifolds. Found. Comput. Math. 7, 3, 303--330. Google ScholarDigital Library
- Anderson, E., Bai, Z., Bischof, C., Blackford, S., Demmel, J., Dongarra, J., Croz, J. D., Greenbaum, A., Hammarling, S., McKenney, A., Ostrouchov, S., and Sorensen, D. 1999. LAPACK Users' Guide, 3rd Ed. SIAM, Philadelphia. Google ScholarDigital Library
- 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.Google ScholarCross Ref
- Baker, C. G., Hetmaniuk, U., Lehoucq, R. B., and Thornquist, H. K. Anasazi: Block eigensolver package documentation. http://trilinos.sandia.gov/trilinos/packages/anasazi/index.html.Google Scholar
- Balay, S., Buschelman, K., Gropp, W. D., Kaushik, D., Knepley, M. G., McInnes, L. C., Smith, B. F., and Zhang, H. 2001. PETSc Web page. http://www.mcs.anl.gov/petsc.Google Scholar
- Bartlett, R., Boggs, P., Coffey, T., Heroux, M., Hoekstra, R., Howle, V., Long, K., Pawlowski, R., Phipps, E., Spotz, B., Thornquist, H., and Williams, A. Thyra: Interfaces for abstract numerical algorithms. http://trilinos.sandia.gov/trilinos/packages/thyra/.Google Scholar
- Bartlett, R. A. 2004. Teuchos::RCP Beginner's Guide. Tech. rep. SAND2004-3268. Sandia National Laboratories, Albugusberg.Google Scholar
- Bhardwaj, M., Pierson, K., Reese, G., Walsh, T., Day, D., Alvin, K., Peery, J., Farhat, C., and Lesoinne, M. 16-22 Nov. 2002. Salinas: A scalable software for high-performance structural and solid mechanics simulations. In Proceedings of the ACM/IEEE Conference on Supercomputing. 35--35. Google ScholarDigital Library
- Blackford, L. S., Demmel, J., Dongarra, J., Duff, I., Hammarling, S., Henry, G., Heroux, M., Kaufman, L., Lumsdaine, A., Petitet, A., Pozo, R., Remington, K., and Whaley, R. C. 2002. An updated set of basic linear algebra subprograms (BLAS). ACM Trans. Math. Softw. 28, 2, 135--151. Google ScholarDigital Library
- 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.Google Scholar
- Detlefs, D. 1992. Garbage collection and run-time typing as a C++ library. In Proceedings: USENIX C++ Technical Conference, USENIX, Ed. USENIX, pub-USENIX:adr, 37--56.Google Scholar
- 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. Google ScholarDigital Library
- Hernández, V., Román, J., Tomás, A., and Vidal, V. 2005. A survey of software for sparse eigenvalue problems. Tech. rep. SLEPc Technical Report STR-6. Universidad Politecnica de Valencia, Valencia, Spain. http://www.grycap.upv.es/slepc.Google Scholar
- Hernández, V., Román, J., Tomás, A., and Vidal, V. 2006. SLEPc users manual: Scalable library for eigenvalue problem computations. Tech. rep. DISC-II/24/02. Universidad Politecnica de Valencia, Valencia, Spain. http://www.grycap.upv.es/slepc.Google Scholar
- Heroux, M., Hoekstra, R., Sexton, P., Spotz, B., Willenbring, J., and Williams, A. Epetra: Linear algebra services package. http://trilinos.sandia.gov/trilinos/packages/epetra/.Google Scholar
- Heroux, M. A., Baker, C. G., Bartlett, R. A., Kampschoff, K., Long, K. R., Sexton, P. M., and Thornquist, H. K. Teuchos: The Trilinos tools library. http://trilinos.sandia.gov/trilinos/packages/teuchos/.Google Scholar
- Heroux, M. A., Bartlett, R. A., Howle, V. E., Hoekstra, R. J., Hu, J. J., Kolda, T. G., Lehoucq, R. B., Long, K. R., Pawlowski, R. P., Phipps, E. T., Salinger, A. G., Thornquist, H. K., Tuminaro, R. S., Willenbring, J. M., Williams, A., and Stanley, K. S. 2005. An overview of the Trilinos project. ACM Trans. Math. Softw. 31, 3, 397--423. Google ScholarDigital Library
- Hetmaniuk, U. and Lehoucq, R. 2006. Basis selection in LOBPCG. J. Comput. Phys. 218, 324--332. Google ScholarDigital Library
- Knyazev, A. V. 2001. Toward the optimal preconditioned eigensolver: Locally optimal block preconditioned conjugate gradient method. SIAM J. Sci. Comput. 23, 517--541. Google ScholarDigital Library
- Lawson, C. L., Hanson, R. J., Kincaid, D. R., and Krogh, F. T. 1979. Basic linear algebra subprograms for Fortran usage. ACM Trans. Math. Softw. 5, 3, 308--323. Google ScholarDigital Library
- Lehoucq, R. B., Sorensen, D. C., and Yang, C. 1998. ARPACK Users' Guide: Solution of Large-Scale Eigenvalue Problems with Implicitly Restarted Arnoldi Methods. SIAM, Philadelphia.Google Scholar
- Meyers, N. C. 1995. Traits: A new and useful template technique. C++ Rep. 7, 32--35.Google Scholar
- 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. Google ScholarDigital Library
- Musser, D. R. and Stepanov, A. A. 1994. Algorithm-oriented generic libraries. Softw. Pract. Exper. 24, 7, 623--642. Google ScholarDigital Library
- Saad, Y. 1992. Numerical Methods for Large Eigenvalue Problems. John Wiley and Sons, New York.Google Scholar
- Sala, M., Heroux, M. A., and Day, D. M. 2004. Trilinos tutorial. Tech. rep. SAND2004-2189. Sandia National Laboratories, Albuquerque.Google Scholar
- 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.Google ScholarCross Ref
- 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. Google ScholarDigital Library
- Sorensen, D. 2002. Numerical Methods for Large Eigenvalue Problems. Acta Numerica, vol. 11. Cambridge University Press, Cambridge, 519--584.Google ScholarCross Ref
- Sorensen, D. C. 1992. Implicit application of polynomial filters in a k-step Arnoldi method. SIAM J. Matrix Anal. Appl. 13, 357--385. Google ScholarDigital Library
- Stathopoulos, A. and McCombs, J. R. 2006. PRIMME home page. http://www.cs.wm.edu/~andreas/software/.Google Scholar
- Stathopoulos, A. and Wu, K. 2002. A block orthogonalization procedure with constant synchronization requirements. SIAM J. Sci. Comput. 23, 2165--2182. Google ScholarDigital Library
- Stewart, G. W. 2001a. A Krylov-Schur algorithm for large eigenproblems. SIAM J. Matrix Anal. Appl. 23, 601--614. Google ScholarDigital Library
- Stewart, G. W. 2001b. Matrix Systems: Eigensystems. vol. II. SIAM, Philadelphia.Google Scholar
- 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.Google Scholar
- Vandevoorde, D. and Josuttis, N. M. 2002. C++ Templates. Addison-Wesley Longman Publishing Co., Inc., Reading. Google ScholarDigital Library
- Veldhuizen, T. 1996. Using C++ trait classes for scientific computing. http://oonumerics.org/blitz/traits.html.Google Scholar
Index Terms
Anasazi software for the numerical solution of large-scale eigenvalue problems
Recommendations
An Inverse Free Preconditioned Krylov Subspace Method for Symmetric Generalized Eigenvalue Problems
In this paper, we present an inverse free Krylov subspace method for finding some extreme eigenvalues of the symmetric definite generalized eigenvalue problem $Ax = \lambda B x$. The basic method takes a form of inner-outer iterations and involves no ...
Improving the parallel performance of a domain decomposition preconditioning technique in the Jacobi-Davidson method for large scale eigenvalue problems
Most computational work in Jacobi-Davidson [G.L.G. Sleijpen, H.A. van der Vorst, A Jacobi-Davidson iteration method for linear eigenvalue problems, SIAM J. Matrix Anal. Appl. 17 (1996) 401-425], an iterative method for large scale eigenvalue problems, ...
Preconditioning bandgap eigenvalue problems in three-dimensional photonic crystals simulations
To explore band structures of three-dimensional photonic crystals numerically, we need to solve the eigenvalue problems derived from the governing Maxwell equations. The solutions of these eigenvalue problems cannot be computed effectively unless a ...
Comments