Rank-Revealing QR Factorizations and the Singular Value Decomposition
From MaRDI portal
Publication:3987930
DOI10.2307/2153029zbMath0743.65037OpenAlexW4233654647WikidataQ114042812 ScholiaQ114042812MaRDI QIDQ3987930
No author found.
Publication date: 28 June 1992
Published in: Mathematics of Computation (Search for Journal in Brave)
Full work available at URL: https://zenodo.org/record/1235097
Factorization of matrices (15A23) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Direct numerical methods for linear systems and matrix inversion (65F05)
Related Items
Strong rank revealing LU factorizations ⋮ Pass-efficient methods for compression of high-dimensional turbulent flow data ⋮ Rank deficiencies and bifurcation into affine subspaces for separable parameterized equations ⋮ Column subset selection problem is UG-hard ⋮ Spectral division methods for block generalized Schur decompositions ⋮ A theory of pseudoskeleton approximations ⋮ Improved bound for rank revealing LU factorizations ⋮ Gram-Schmidt orthogonalization: 100 years and more ⋮ Componentwise analysis of direct factorization of real symmetric and Hermitian matrices ⋮ Simple varieties for limited precision points ⋮ Simpler is better: a comparative study of randomized pivoting algorithms for CUR and interpolative decompositions ⋮ On the solution of large-scale algebraic Riccati equations by using low-dimensional invariant subspaces ⋮ Algebraic inverse fast multipole method: a fast direct solver that is better than HODLR based fast direct solver ⋮ Exponential inapproximability of selecting a maximum volume sub-matrix ⋮ A fast randomized algorithm for computing an approximate null space ⋮ The Computation of Low Multilinear Rank Approximations of Tensors via Power Scheme and Random Projection ⋮ Unnamed Item ⋮ Literature survey on low rank approximation of matrices ⋮ Low Rank Approximation of a Sparse Matrix Based on LU Factorization with Column and Row Tournament Pivoting ⋮ Structural instability analyses based on generalised path-following ⋮ Least upper bound of truncation error of low-rank matrix approximation algorithm using QR decomposition with pivoting ⋮ Fast linear algebra is stable ⋮ A block algorithm for computing rank-revealing QR factorizations ⋮ A block \(\mathrm{GCROT}(m, k)\) method for linear systems with multiple right-hand sides ⋮ A note on properties and computations of matrix pseudospectra ⋮ On iterative QR pre-processing in the parallel block-Jacobi SVD algorithm ⋮ Hierarchical Cholesky decomposition of sparse matrices arising from curl–curl-equation ⋮ A Fast Memory Efficient Construction Algorithm for Hierarchically Semi-Separable Representations ⋮ Column subset selection via sparse approximation of SVD ⋮ On selecting a maximum volume sub-matrix of a matrix and related problems ⋮ Sparse Polynomial Chaos Expansions: Literature Survey and Benchmark ⋮ Deviation maximization for rank-revealing QR factorizations ⋮ Randomized Approximation of the Gram Matrix: Exact Computation and Probabilistic Bounds ⋮ On the existence and computation of rank-revealing LU factorizations ⋮ Fast and Accurate Gaussian Kernel Ridge Regression Using Matrix Decompositions for Preconditioning ⋮ Efficient Construction of Tensor Ring Representations from Sampling ⋮ Subspace Iteration Randomization and Singular Value Problems ⋮ Random multipliers numerically stabilize Gaussian and block Gaussian elimination: proofs and an extension to low-rank approximation ⋮ A Nonlinear QR Algorithm for Banded Nonlinear Eigenvalue Problems
