Reducing synchronization on the parallel Davidson method for the large sparse, eigenvalue problem

Authors:
A. Stathopoulos;C. F. Fischer
Affiliations:
Computer Science Department, Vanderbilt University, Nashville, TN;Computer Science Department, Vanderbilt University, Nashville, TN
Venue:
Proceedings of the 1993 ACM/IEEE conference on Supercomputing
Year:
1993

Citing 5
Cited 3

Generalizations of Davidson's method for computing eigenvalues of sparse symmetric matrices

SIAM Journal on Scientific and Statistical Computing
Krylov subspace methods on supercomputers

SIAM Journal on Scientific and Statistical Computing
Preconditioning the Lanczos algorithm for sparse symmetric eigenvalue problems

SIAM Journal on Scientific Computing
Matrix computations (3rd ed.)

Matrix computations (3rd ed.)
The symmetric eigenvalue problem

The symmetric eigenvalue problem

Multigrain Parallelism for Eigenvalue Computations on Networks of Clusters

HPDC '02 Proceedings of the 11th IEEE International Symposium on High Performance Distributed Computing
Parallel, multigrain iterative solvers for hiding network latencies on MPPs and networks of clusters

Parallel Computing - Parallel matrix algorithms and applications (PMAA '02)
PRIMME: preconditioned iterative multimethod eigensolver—methods and software description

ACM Transactions on Mathematical Software (TOMS)

Quantified Score

Hi-index	0.00

Visualization

Abstract