A Parallel Implementation Of The Invariant Subspace Decomposition Algorithm For Dense Symmetrical Matrices

S Husslederman, A Tsao,Gd Zhang

PROCEEDINGS OF THE SIXTH SIAM CONFERENCE ON PARALLEL PROCESSING FOR SCIENTIFIC COMPUTING, VOLS 1 AND 2(1993)

引用 32|浏览16
暂无评分
摘要
. We give an overview of the Invariant Subspace Decomposition Algorithm for dense symmetric matrices(SYISDA) by first describing the algorithm, followed by a discussion of a parallel implementation of SYISDAon the Intel Delta. Our implementation utilizes an optimized parallel matrix multiplication implementation wehave developed. Load balancing in the costly early stages of the algorithm is accomplished without redistributionof data between stages through the use of the block scattered...
更多
查看译文
关键词
EIGENVALUES, SYMMETRICAL MATRICES, DIVIDE AND CONQUER ALGORITHM, INVARIANT SUBSPACES, PARALLEL ALGORITHM
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要