.png){kind=icon}
Return
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}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
SINGULAR-VALUE DECOMPOSITION
EIGENVALUE
ARRAY
Journal
IF:
4
Papers:
3.8K
Citations:
4.8K
Organization
No organization information available
Cited Papers
ShareSaveDistribution of the density of states of bonded hydrogen in amorphous hydrogenated silicon.png)
Solar Cells
Solar CellsIF0
PREAI
ShareSaveShareSaveBiotin-8-hydroxyquinoline conjugates and their metal complexes: Exploring the chemical properties and the antioxidant activityPolyhedron
PolyhedronIF0
PREAI
ShareSaveShareSaveShareSaveInteractive program for visualization and modelling of proteins, nucleic acids and small molecules
PREAI
ShareSaveAN EFFICIENT ALGORITHM FOR FOLEY–SAMMON OPTIMAL SET OF DISCRIMINANT VECTORS BY ALGEBRAIC METHOD
PREAI
ShareSave
View more