.png){kind=icon}
返回
A parallel Davidson-type algorithm for several eigenvalues
.png){kind=icon}
PRE
AI
DOI：10.1006/jcph.1998.6003.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
EIGENVECTORS
MATRICES
SPARSE
PROGRAM
REAL
期刊
IF:
3.8
论文数:
1.6W
被引数:
7.4W
机构
暂无机构信息
引用论文
.png){kind=icon}
Research on Individual Recognition and Matching of Whale and Dolphin Based on EfficientNet Model
PREAI
分享收藏Rubber hand illusion, empathy, and schizotypal experiences in terms of self-other representations橡胶手的错觉，同理心和分裂型经验在自我-他人表征方面
PREAI
分享收藏
查看更多内容