On efficient implementations of Kogbetliantz's algorithm for computing the singular value decomposition
From MaRDI portal
(Redirected from Publication:1822207)
We compare several implementations of Kogbetliantz's algorithm for computing the SVD on sequential as well as on parallel machines. Comparisons are based on timings and on operation counts. The numerical accuracy of the different methods is also analyzed.
Recommendations
- A contribution to the theory and practice of the block Kogbetliantz method for computing the SVD
- Reducing the Computations of the Singular Value Decomposition Array Given by Brent and Luk
- On high relative accuracy of the Kogbetliantz method
- Parallelizing the Kogbetliantz method: a first attempt
- A Parallel Algorithm for Computing the Singular Value Decomposition of a Matrix
Cites work
- A Jacobi-Like Algorithm for Computing the Schur Decomposition of a Nonhermitian Matrix
- A proof of convergence for two parallel Jacobi SVD algorithms
- A triangular processor array for computing singular values
- Basic Linear Algebra Subprograms for Fortran Usage
- Computing the Generalized Singular Value Decomposition
- Computing the Singular Value Decomposition of a Product of Two Matrices
- Data-flow algorithms for parallel matrix computation
- Efficient implementation of Jacobi's diagonalization method on the DAP
- scientific article; zbMATH DE number 3963085 (Why is no real title available?)
- scientific article; zbMATH DE number 3892457 (Why is no real title available?)
- scientific article; zbMATH DE number 3408799 (Why is no real title available?)
- On Kogbetliantz's SVD algorithm in the presence of clusters
- On Parallel Jacobi Orderings
- On the quadratic convergence of Kogbetliantz's algorithm for computing the singular value decomposition
- Solution of linear equations by diagonalization of coefficients matrix
- The Cyclic Jacobi Method for Computing the Principal Values of a Complex Matrix
- 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
- On Kogbetliantz's SVD algorithm in the presence of clusters
- An overview of parallel algorithms for the singular value and symmetric eigenvalue problems
- On sharp quadratic convergence bounds for the serial Jacobi methods
- An implicit Jacobi-like method for computing generalized hyperbolic SVD
- Mapping 3-D IIR digital filter onto systolic arrays
- A Kogbetliantz-type algorithm for the hyperbolic SVD
- Convergence to diagonal form of block Jacobi-type methods
- Butterfly matrices and the modulus Kogbetliantz method
- Reducing the Computations of the Singular Value Decomposition Array Given by Brent and Luk
- Special Issue: A systolic block-Jacobi SVD solver for processor meshes
- On high relative accuracy of the Kogbetliantz method
- Batched computation of the singular value decompositions of order two by the AVX-512 vectorization
- Parallelizing the Kogbetliantz method: a first attempt
- Updating the singular value decomposition
- Accuracy of the Kogbetliantz method for scaled diagonally dominant triangular matrices
- Arithmetical enhancements of the Kogbetliantz method for the SVD of order two
- A contribution to the theory and practice of the block Kogbetliantz method for computing the SVD
- Global and quadratic convergence of the block Jacobi method for Hermitian matrices under the de Rijk pivot strategy
This page was built for publication: On efficient implementations of Kogbetliantz's algorithm for computing the singular value decomposition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1822207)
