A Systolic Array for SVD Updating
From MaRDI portal
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.
Recommendations
Cited in
(12)- A systolic algorithm for QSVD updating
- On the QR algorithm and updating the SVD and the URV decomposition in parallel
- On systolic arrays for updating the Cholesky factorization
- scientific article; zbMATH DE number 125154 (Why is no real title available?)
- Combined systolic array for matrix portrait computation
- Special Issue: A systolic block-Jacobi SVD solver for processor meshes
- Systolic SVD and QR Decomposition by Householder Reflections
- Computing the CS-Decomposition on Systolic Arrays
- scientific article; zbMATH DE number 782077 (Why is no real title available?)
- scientific article; zbMATH DE number 782078 (Why is no real title available?)
- scientific article; zbMATH DE number 782081 (Why is no real title available?)
- scientific article; zbMATH DE number 4187004 (Why is no real title available?)
This page was built for publication: A Systolic Array for SVD Updating
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5286279)