.png){kind=icon}
返回
A parallel ring ordering algorithm for efficient one-sided Jacobi SVD computations
.png){kind=icon}
PRE
AI
DOI：10.1006/jpdc.1997.1304.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper we give evidence to show that in one-sided Jacobi SVD computation the sorting of column norms in each sweep is very important. An efficient parallel ring Jacobi ordering for computing singular value decomposition is described, This ordering can generate n(n -1)/2 different index pairs and sort column norms at the same time, The one-sided Jacobi SVD algorithm using this parallel ordering converges in about the same number of sweeps as the sequential cyclic Jacobi algorithm. The issue of equivalence of orderings for one-sided Jacobi is also discussed, We show how an ordering which does not sort column norms into order may still perform efficiently as long as it can generate the same index pairs at the same step as one which does sorting, Some experimental results on a Fujitsu AP1000 are presented, (C) 1997 Academic Press.
Keyword:
SINGULAR-VALUE DECOMPOSITION
EIGENVALUE
ARRAY
期刊
IF:
4
论文数:
3.8K
被引数:
4.8K
机构
暂无机构信息
引用论文
Distribution of the density of states of bonded hydrogen in amorphous hydrogenated silicon.png)
Solar Cells
Solar CellsIF0
PREAI
分享收藏分享收藏Biotin-8-hydroxyquinoline conjugates and their metal complexes: Exploring the chemical properties and the antioxidant activityPolyhedron
PolyhedronIF0
PREAI
分享收藏Interactive program for visualization and modelling of proteins, nucleic acids and small molecules
PREAI
分享收藏AN EFFICIENT ALGORITHM FOR FOLEY–SAMMON OPTIMAL SET OF DISCRIMINANT VECTORS BY ALGEBRAIC METHOD
PREAI
分享收藏
查看更多内容