Parallel Arnoldi eigensolvers with enhanced scalability via global communications rearrangement

This paper presents several new variants of the single-vector Arnoldi algorithm for computing approximations to eigenvalues and eigenvectors of a non-symmetric matrix. The context of this work is the efficient implementation of industrial-strength, parallel, sparse eigensolvers, in which robustness...

Full description

Bibliographic Details

Published in:	Parallel computing Vol. 33; no. 7; pp. 521 - 540
Main Authors:	Hernandez, V., Roman, J.E., Tomas, A.
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 01.08.2007
Subjects:	Arnoldi eigensolvers Distributed-memory programming Iterative Gram-Schmidt orthogonalization Arnoldi eigensolvers Iterative Gram-Schmidt orthogonalization Distributed-memory programming
ISSN:	0167-8191, 1872-7336
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!