论文信息 - SLEPc: Scalable Library for Eigenvalue Problem Computations

SLEPc: Scalable Library for Eigenvalue Problem Computations

The eigenvalue problem is one of the most important problems in numerical linear algebra. Several public domain software libraries are available for solving it. In this work, a new petsc-based package is presented, which is intended to be an easy-to-use yet efficient object-oriented parallel framework for the solution of standard and generalised eigenproblems, either in real or complex arithmetic. The main objective is to allow the solution of real world problems in a straightforward way, especially in the case of large software projects.

[1] Antonio M. Vidal,et al. Calculation of Lambda Modes of a Nuclear Reactor: A Parallel Implementation Using the Implicitly Restarted Arnoldi Method , 1998, VECPAR.

[2] Jack Dongarra,et al. Templates for the Solution of Algebraic Eigenvalue Problems , 2000, Software, environments, tools.

[3] Xindong Wu,et al. Research and Development in Knowledge Discovery and Data Mining , 1998, Lecture Notes in Computer Science.

[4] Jack Dongarra,et al. A Test Matrix Collection for Non-Hermitian Eigenvalue Problems , 1997 .

[5] H. Simon,et al. A parallel Lanczos method for symmetric generalized eigenvalue problems , 1999 .

[6] G. Golub,et al. Eigenvalue computation in the 20th century , 2000 .

[7] William Gropp,et al. PETSc 2.0 users manual , 2000 .

[8] Danny C. Sorensen,et al. P_ARPACK: An Efficient Portable Large Scale Eigenvalue Package for Distributed Memory Parallel Architectures , 1996, PARA.

[9] Chao Yang,et al. ARPACK users' guide - solution of large-scale eigenvalue problems with implicitly restarted Arnoldi methods , 1998, Software, environments, tools.

[10] Kesheng Wu,et al. Thick-Restart Lanczos Method for Symmetric Eigenvalue Problems , 1998, IRREGULAR.