A Divide-and-Conquer Algorithm for the Bidiagonal SVD
From MaRDI portal
Recommendations
- An accelerated divide-and-conquer algorithm for the bidiagonal SVD problem
- An efficient and accurate parallel algorithm for the singular value problem of bidiagonal matrices
- A Parallel Algorithm for Computing the Singular Value Decomposition of a Matrix
- scientific article; zbMATH DE number 782062
- Divide and conquer the CS decomposition
Cited in
(35)- A Lanczos bidiagonalization algorithm for Hankel matrices
- A differential equation approach to the singular value decomposition of bidiagonal matrices
- Look-ahead in the two-sided reduction to compact band forms for symmetric eigenvalue problems and the SVD
- A new stable bidiagonal reduction algorithm
- An \({\mathcal O}(n^{2})\) algorithm for the bidiagonal SVD
- Highly accurate symmetric eigenvalue decomposition and hyperbolic SVD
- An improved divide-and-conquer algorithm for the banded matrices with narrow bandwidths
- Numerical methods for accurate computation of the eigenvalues of Hermitian matrices and the singular values of general matrices
- A divide-and-conquer algorithm for binary matrix completion
- The \(\mathrm{MR}^{3}\)-GK algorithm for the bidiagonal SVD
- Superfast divide-and-conquer method and perturbation analysis for structured eigenvalue solutions
- Proposal and efficient implementation of multiple division divide-and-conquer algorithm for SVD
- Divide and conquer the CS decomposition
- An accelerated divide-and-conquer algorithm for the bidiagonal SVD problem
- Computing Fundamental Matrix Decompositions Accurately via the Matrix Sign Function in Two Iterations: The Power of Zolotarev's Functions
- A Parallel Algorithm for Computing the Singular Value Decomposition of a Matrix
- The singular value decomposition: anatomy of optimizing an algorithm for extreme scale
- A fast contour-integral eigensolver for non-Hermitian matrices
- A Simple SVD Algorithm for Finding Hidden Partitions
- Accurate eigenvalue decomposition of real symmetric arrowhead matrices and applications
- Bidiagonal SVD Computation via an Associated Tridiagonal Eigenproblem
- Analytical low-rank compression via proxy point selection
- Restructuring the tridiagonal and bidiagonal QR algorithms for performance
- Accurate polynomial root-finding methods for symmetric tridiagonal matrix eigenproblems
- A high performance QDWH-SVD solver using hardware accelerators
- Computing the Bidiagonal SVD Using Multiple Relatively Robust Representations
- Linear algebra software for large-scale accelerated multicore computing
- Deflation for the symmetric arrowhead and diagonal-plus-rank-one eigenvalue problems
- Computation of Gauss-type quadrature formulas
- Low-rank tensor methods for partial differential equations
- Dynamic normal forms and dynamic characteristic polynomial
- Randomized low-rank approximation methods for projection-based model order reduction of large nonlinear dynamical problems
- A stable matrix version of the 2D fast multipole method
- Forward stable eigenvalue decomposition of rank-one modifications of diagonal matrices
- On homogeneous least-squares problems and the inconsistency introduced by mis-constraining
This page was built for publication: A Divide-and-Conquer Algorithm for the Bidiagonal SVD
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4325679)
