An accelerated divide-and-conquer algorithm for the bidiagonal SVD problem
From MaRDI portal
Recommendations
- A Divide-and-Conquer Algorithm for the Bidiagonal SVD
- Divide and conquer the CS decomposition
- New fast divide-and-conquer algorithms for the symmetric tridiagonal eigenvalue problem.
- An improved divide-and-conquer algorithm for the banded matrices with narrow bandwidths
- An efficient and accurate parallel algorithm for the singular value problem of bidiagonal matrices
Cites work
- A Divide-and-Conquer Algorithm for the Bidiagonal SVD
- A Divide-and-Conquer Algorithm for the Symmetric Tridiagonal Eigenproblem
- A Fast ULV Decomposition Solver for Hierarchically Semiseparable Representations
- A fast algorithm for particle simulations
- A Fast Algorithm for the Multiplication of Generalized Hilbert Matrices with Vectors
- A Fast Solver for HSS Representations via Sparse Matrices
- A Parallel Algorithm for Computing the Singular Value Decomposition of a Matrix
- A sparse matrix arithmetic based on \({\mathfrak H}\)-matrices. I: Introduction to \({\mathfrak H}\)-matrices
- A Stable and Efficient Algorithm for the Rank-One Modification of the Symmetric Eigenproblem
- A Superfast Algorithm for Toeplitz Systems of Linear Equations
- Accurate Singular Value Decompositions of Structured Matrices
- Accurate singular values and differential qd algorithms
- An implementation of the dqds algorithm (positive case)
- An improved DQDS algorithm
- An Improved Fast Multipole Algorithm for Potential Fields on the Line
- Approximation of 1/x by exponential sums in [1, ∞)
- Data-sparse approximation by adaptive \({\mathcal H}^2\)-matrices
- Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization
- Efficient scalable algorithms for solving dense linear systems with hierarchically semiseparable structures
- Fast algorithms for generalized displacement structures and lossless systems
- Fast algorithms for hierarchically semiseparable matrices
- Fast Algorithms for Polynomial Interpolation, Integration, and Differentiation
- Fast Gaussian Elimination with Partial Pivoting for Matrices with Displacement Structure
- Finding structure with randomness: probabilistic algorithms for constructing approximate matrix decompositions
- scientific article; zbMATH DE number 1682655 (Why is no real title available?)
- scientific article; zbMATH DE number 691245 (Why is no real title available?)
- scientific article; zbMATH DE number 1049347 (Why is no real title available?)
- scientific article; zbMATH DE number 3273551 (Why is no real title available?)
- scientific article; zbMATH DE number 3408799 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- Minimizing communication in numerical linear algebra
- New efficient and robust HSS Cholesky factorization of SPD matrices
- On the Compression of Low Rank Matrices
- On the existence and computation of rank-revealing LU factorizations
- On the Spectral Decomposition of Hermitian Matrices Modified by Low Rank Perturbations with Applications
- Performance and Accuracy of LAPACK's Symmetric Tridiagonal Eigensolvers
- Principal submatrices. IX: Interlacing inequalities for singular values of submatrices
- Robust Approximate Cholesky Factorization of Rank-Structured Symmetric Positive Definite Matrices
- Stable and Efficient Algorithms for Structured Systems of Linear Equations
- Strong rank revealing LU factorizations
- Superfast and stable structured solvers for Toeplitz least squares via randomized sampling
- Über monotone Matrixfunktionen
Cited in
(12)- An efficient and accurate parallel algorithm for the singular value problem of bidiagonal matrices
- An improved divide-and-conquer algorithm for the banded matrices with narrow bandwidths
- High-dimensional integrative analysis with homogeneity and sparsity recovery
- A fast and stable algorithm for downdating the singular value decomposition
- Proposal and efficient implementation of multiple division divide-and-conquer algorithm for SVD
- New fast divide-and-conquer algorithms for the symmetric tridiagonal eigenvalue problem.
- Accelerated bisection techniques for tri‐ and quindiagonal matrices
- A Divide-and-Conquer Algorithm for the Bidiagonal SVD
- The singular value decomposition: anatomy of optimizing an algorithm for extreme scale
- Bidiagonal SVD Computation via an Associated Tridiagonal Eigenproblem
- An efficient hybrid tridiagonal divide-and-conquer algorithm on distributed memory architectures
- Subset selection for matrices by volume sampling
This page was built for publication: An accelerated divide-and-conquer algorithm for the bidiagonal SVD problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2936585)
