A Parallel Implementation of the Trace Minimization Eigensolver

Authors:
Eloy Romero;Jose E. Roman
Affiliations:
Instituto ITACA, Universidad Politécnica de Valencia, Valencia, Spain 46022;Instituto ITACA, Universidad Politécnica de Valencia, Valencia, Spain 46022
Venue:
High Performance Computing for Computational Science - VECPAR 2008
Year:
2008

Citing 8
Cited 0

The symmetric eigenvalue problem

The symmetric eigenvalue problem
A Jacobi--Davidson Iteration Method for Linear Eigenvalue Problems

SIAM Review
Templates for the solution of algebraic eigenvalue problems: a practical guide

Templates for the solution of algebraic eigenvalue problems: a practical guide
The trace minimization method for the symmetric generalized eigenvalue problem

Journal of Computational and Applied Mathematics - Special issue on numerical analysis 2000 Vol. III: linear algebra
Matrix algorithms

Matrix algorithms
BoomerAMG: a parallel algebraic multigrid solver and preconditioner

Applied Numerical Mathematics - Developments and trends in iterative methods for large systems of equations—in memoriam Rüdiger Weiss
SLEPc: A scalable and flexible toolkit for the solution of eigenvalue problems

ACM Transactions on Mathematical Software (TOMS) - Special issue on the Advanced CompuTational Software (ACTS) Collection
Parallel Arnoldi eigensolvers with enhanced scalability via global communications rearrangement

Parallel Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we describe a parallel implementation of the trace minimization method for symmetric generalized eigenvalue problems proposed by Sameh and Wisniewski. The implementation includes several techniques proposed in a later article of Sameh, such as multishifting, preconditioning and adaptive inner solver termination, which accelerate the method and make it much more robust. A Davidson-type variant of the algorithm has been also considered. The different methods are analyzed in terms of sequential and parallel efficiency.