
doi: 10.1137/0614025
A singular value decomposition (SVD) updating algorithm supplemented with a certain re-orthogonalization scheme is implemented on a systolic array with \(O(n^ 2)\) parallelism for \(O(n^ 2)\) complexity, by combining systolic implementations for the matrix-vector product, the QR updating and the SVD. It is shown that a main computational bottleneck for the array implementation can be overcome with a square root-free SVD algorithm based on modified Givens rotations and approximate schemes for the computation of rotation angles in the SVD steps.
Numerical computation of eigenvalues and eigenvectors of matrices, Complexity and performance of numerical algorithms, systolic array, singular value decomposition updating algorithm, recursive least squares, parallel algorithms, Parallel numerical computation, re-orthogonalization scheme, Givens rotations, complexity, Orthogonalization in numerical linear algebra
Numerical computation of eigenvalues and eigenvectors of matrices, Complexity and performance of numerical algorithms, systolic array, singular value decomposition updating algorithm, recursive least squares, parallel algorithms, Parallel numerical computation, re-orthogonalization scheme, Givens rotations, complexity, Orthogonalization in numerical linear algebra
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 30 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Top 10% |
