A triangular processor array for computing singular values
From MaRDI portal
A triangular processor array for computing the singular values of an \(m\times n\) (m\(\geq n)\) matrix is proposed. A Jacobi-type algorithm is used to first triangularize the given matrix and then diagonalize the resultant triangular form. The requirements are \((1/4)n^ 2+O(n)\) processors and \(O(m+nS)\) time, where S denotes the number of sweeps. The triangular array can be extended to a rectangular one with \(mn+O(m)\) processors for the computation of singular vectors.
Recommendations
- scientific article; zbMATH DE number 3963085
- scientific article; zbMATH DE number 3880005
- The Solution of Singular-Value and Symmetric Eigenvalue Problems on Multiprocessor Arrays
- scientific article; zbMATH DE number 3978274
- A size-independent systolic array for matrix triangularization and eigenvalue computation
Cites work
- A Jacobi-Like Algorithm for Computing the Schur Decomposition of a Nonhermitian Matrix
- A Rotation Method for Computing the QR-Decomposition
- An Improved Algorithm for Computing the Singular Value Decomposition
- Computing the Singular-Value Decomposition on the ILLIAC IV
- Data-flow algorithms for parallel matrix computation
- scientific article; zbMATH DE number 3963085 (Why is no real title available?)
- scientific article; zbMATH DE number 3892457 (Why is no real title available?)
- Numerically Stable Solution of Dense Systems of Linear Equations Using Mesh-Connected Processors
- On Jacobi and Jacobi-Like Algorithms for a Parallel Computer
- Systolic Networks for Orthogonal Decompositions
- The Solution of Singular-Value and Symmetric Eigenvalue Problems on Multiprocessor Arrays
Cited in
(19)- Accuracy of two SVD algorithms for \(2\times 2\) triangular matrices
- A systolic algorithm for Riccati and Lyapunov equations
- Canonical correlations and generalized SVD: Applications and new algorithms
- On sharp quadratic convergence bounds for the serial Jacobi methods
- Trends in systolic and cellular computation
- On the QR algorithm and updating the SVD and the URV decomposition in parallel
- On efficient implementations of Kogbetliantz's algorithm for computing the singular value decomposition
- Linear convergence of the row cyclic Jacobi and Kogbetliantz methods
- An implicit Jacobi-like method for computing generalized hyperbolic SVD
- Scalable parallel processor array for Jacobi-type matrix computations
- Parallel computation of the modified extended kalman filter
- BLOCK-JACOBI SVD ALGORITHMS FOR DISTRIBUTED MEMORY SYSTEMS I: HYPERCUBES AND RINGS*
- Special Issue: A systolic block-Jacobi SVD solver for processor meshes
- Elimination of the computational broadcast in systolic arrays: an application to the qr decomposition algorithm
- Systolic SVD and QR Decomposition by Householder Reflections
- On high relative accuracy of the Kogbetliantz method
- Accuracy of the Kogbetliantz method for scaled diagonally dominant triangular matrices
- A contribution to the theory and practice of the block Kogbetliantz method for computing the SVD
- Some complexity results in parallel matrix-based signal processing
This page was built for publication: A triangular processor array for computing singular values
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1072344)
