.png){kind=icon}
Return
A parallel Davidson-type algorithm for several eigenvalues
.png){kind=icon}
PRE
AI
DOI：10.1006/jcph.1998.6003.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper we propose a new parallelization of the Davidson algorithm adapted for many eigenvalues. In our parallelization we use a relationship between two consecutive subspaces which allows us to calculate eigenvalues in the subspace through an arrowhead matrix. Theoretical timing estimates for the parallel algorithm are developed and compared against our numerical results on the Paragon. Finally our algorithm is compared against another recent parallel algorithm for multiple eigenvalues, but based on Arnoldi: PARPACK. (C) 1998 Academic Press.
Keywords:
EIGENVECTORS
MATRICES
SPARSE
PROGRAM
REAL
Journal
IF:
3.8
Papers:
1.6W
Citations:
7.4W
Organization
No organization information available
Cited Papers
.png){kind=icon}
ShareSaveResearch on Individual Recognition and Matching of Whale and Dolphin Based on EfficientNet Model
PREAI
ShareSaveShareSaveRubber hand illusion, empathy, and schizotypal experiences in terms of self-other representations
PREAI
ShareSaveShareSave
ShareSave
View more