.png){kind=icon}
Return
A parallel algorithm for the reduction to tridiagonal form for eigendecomposition
.png){kind=icon}
OA
AI
DOI：10.1137/S1064827595296719.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
One-sided orthogonal transformations which orthogonalize columns of a matrix are related to methods for finding singular values. They have the advantages of lending themselves to parallel and vector implementations and simplifying access to the data by not requiring access to both rows and columns. They can be used to find eigenvalues when the matrix is given in factored form. Here, a finite sequence of transformations leading to a partial orthogonalization of the columns is described. This permits a tridiagonal matrix whose eigenvalues are the squared singular values to be derived. The implementation on the Fujitsu VPP series is discussed and some timing results are presented.
Keywords:
parallel computing
reduction algorithms
one-sided reductions
Journal
IF:
2.6
Papers:
5.1K
Citations:
1.8W
Organization
No organization information available
Cited Papers
ShareSaveLow-frequency magnetic interference in a SQUID gradiometer caused by a Cryotiger® gas-mixture cooler.png)
Cryogenics
OAAI
CryogenicsIF0
OAAIShareSave
View more