Parallel Studies Of The Invariant Subspace Decomposition Approach For Banded Symmetric Matrices

C Bischof, S Husslederman,Xb Sun, A Tsao, T Turnbull

PROCEEDINGS OF THE SEVENTH SIAM CONFERENCE ON PARALLEL PROCESSING FOR SCIENTIFIC COMPUTING（1995）

引用 26|浏览9

暂无评分

摘要

We present an overview of the banded Invariant Subspace Decomposition Algorithmfor symmetric matrices and describe a parallel implementation of this algorithm. Thealgorithm described here is a promising variant of the Invariant Subspace DecompositionAlgorithm for dense symmetric matrices (SYISDA) that retains the property of usingscalable primitives, while requiring significantly less overall computation than SYISDA.1 IntroductionComputation of eigenvalues and eigenvectors is an...

查看译文

关键词

eigenvalues and eigenvectors,symmetric matrices

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要