An Accelerated Divide-and-Conquer Algorithm for the Bidiagonal SVD Problem
DOI10.1137/130945995zbMath1305.65127OpenAlexW2027044527MaRDI QIDQ2936585
Ming Gu, Xuebin Chi, Meng Sun, Li-Zhi Cheng, Sheng-Guo Li
Publication date: 17 December 2014
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/130945995
numerical examplessingular value decompositionSchur complementsbidiagonal matricesdivide-and-conquer algorithmsymmetric tridiagonal eigenvalue problemCauchy-like matriceshierarchically semiseparable (HSS) matrices
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Toeplitz, Cauchy, and related matrices (15B05)
Related Items (6)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions
- A sparse matrix arithmetic based on \({\mathfrak H}\)-matrices. I: Introduction to \({\mathfrak H}\)-matrices
- Accurate singular values and differential qd algorithms
- On the existence and computation of rank-revealing LU factorizations
- Über monotone Matrixfunktionen
- Data-sparse approximation by adaptive \({\mathcal H}^2\)-matrices
- Strong rank revealing LU factorizations
- Fast algorithms for generalized displacement structures and lossless systems
- An implementation of the dqds algorithm (positive case)
- Principal submatrices. IX: Interlacing inequalities for singular values of submatrices
- Superfast and Stable Structured Solvers for Toeplitz Least Squares via Randomized Sampling
- An Improved DQDS Algorithm
- Robust Approximate Cholesky Factorization of Rank-Structured Symmetric Positive Definite Matrices
- Fast algorithms for hierarchically semiseparable matrices
- Minimizing Communication in Numerical Linear Algebra
- A Superfast Algorithm for Toeplitz Systems of Linear Equations
- Performance and Accuracy of LAPACK's Symmetric Tridiagonal Eigensolvers
- On the Spectral Decomposition of Hermitian Matrices Modified by Low Rank Perturbations with Applications
- A Fast Algorithm for the Multiplication of Generalized Hilbert Matrices with Vectors
- An Improved Fast Multipole Algorithm for Potential Fields on the Line
- A Parallel Algorithm for Computing the Singular Value Decomposition of a Matrix
- A Stable and Efficient Algorithm for the Rank-One Modification of the Symmetric Eigenproblem
- A Divide-and-Conquer Algorithm for the Bidiagonal SVD
- A Divide-and-Conquer Algorithm for the Symmetric Tridiagonal Eigenproblem
- Stable and Efficient Algorithms for Structured Systems of Linear Equations
- Fast Algorithms for Polynomial Interpolation, Integration, and Differentiation
- Fast Gaussian Elimination with Partial Pivoting for Matrices with Displacement Structure
- Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization
- New Efficient and Robust HSS Cholesky Factorization of SPD Matrices
- Accurate Singular Value Decompositions of Structured Matrices
- A Fast $ULV$ Decomposition Solver for Hierarchically Semiseparable Representations
- On the Compression of Low Rank Matrices
- Efficient Scalable Algorithms for Solving Dense Linear Systems with Hierarchically Semiseparable Structures
- A Fast Solver for HSS Representations via Sparse Matrices
- Approximation of 1/x by exponential sums in [1, ∞)
- A fast algorithm for particle simulations
This page was built for publication: An Accelerated Divide-and-Conquer Algorithm for the Bidiagonal SVD Problem
