On the existence and computation of rank-revealing LU factorizations
From MaRDI portal
Publication:1587285
DOI10.1016/S0024-3795(00)00120-8zbMath0962.65023WikidataQ114122594 ScholiaQ114122594MaRDI QIDQ1587285
Publication date: 31 May 2001
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
algorithmsGaussian eliminationsingular valuesSchur complementsrank revealing LU factorizationblock pivoting
Numerical solutions to overdetermined systems, pseudoinverses (65F20) Direct numerical methods for linear systems and matrix inversion (65F05)
Related Items (max. 100)
Strong rank revealing LU factorizations ⋮ Numerically safe Gaussian elimination with no pivoting ⋮ A fast and stable algorithm for downdating the singular value decomposition ⋮ Cholesky decomposition with fixing nodes to stable computation of a generalized inverse of the stiffness matrix of a floating structure ⋮ Properties of the CMP inverse and its computation ⋮ New studies of randomized augmentation and additive preprocessing ⋮ An Accelerated Divide-and-Conquer Algorithm for the Bidiagonal SVD Problem ⋮ Time and space efficient generators for quasiseparable matrices ⋮ Simpler is better: a comparative study of randomized pivoting algorithms for CUR and interpolative decompositions ⋮ Pass-efficient randomized LU algorithms for computing low-rank matrix approximation ⋮ Polynomial time \(\rho\)-locally maximum volume search ⋮ Randomized LU decomposition ⋮ New fast divide-and-conquer algorithms for the symmetric tridiagonal eigenvalue problem ⋮ Mechanism free domain decomposition ⋮ Exponential inapproximability of selecting a maximum volume sub-matrix ⋮ A Fast Algorithm for Computing Macaulay Null Spaces of Bivariate Polynomial Systems ⋮ The Computation of Low Multilinear Rank Approximations of Tensors via Power Scheme and Random Projection ⋮ Exact expressions for the Drazin inverse of anti-triangular matrices ⋮ Unnamed Item ⋮ Cholesky decomposition of a positive semidefinite matrix with known kernel ⋮ Optimal CUR Matrix Decompositions ⋮ Parallel cross interpolation for high-precision calculation of high-dimensional integrals ⋮ Low Rank Approximation of a Sparse Matrix Based on LU Factorization with Column and Row Tournament Pivoting ⋮ Numerical approximation of multiple isolated roots of analytical systems ⋮ An \(\mathcal O(N\log N)\) fast direct solver for partial hierarchically semi-separable matrices. With application to radial basis function interpolation ⋮ Solving linear systems of equations with randomization, augmentation and aggregation ⋮ Implementation of an interior point method with basis preconditioning ⋮ About noneigenvector source localization methods ⋮ Computing \(\{2,4\}\) and \(\{2,3\}\)-inverses by using the Sherman-Morrison formula ⋮ Introduction to Communication Avoiding Algorithms for Direct Methods of Factorization in Linear Algebra ⋮ Rank revealing Gaussian elimination by the maximum volume concept ⋮ Randomized LU decomposition using sparse projections ⋮ Optimal sensors placement in dynamic damage detection of beams using a statistical approach ⋮ Fast multipole preconditioners for sparse matrices arising from elliptic equations ⋮ A Fast Memory Efficient Construction Algorithm for Hierarchically Semi-Separable Representations ⋮ On the accuracy of cross and column low-rank maxvol approximations in average ⋮ Single-pass randomized algorithms for LU decomposition ⋮ On maximum volume submatrices and cross approximation for symmetric semidefinite and diagonally dominant matrices ⋮ On selecting a maximum volume sub-matrix of a matrix and related problems ⋮ Fast and Accurate Gaussian Kernel Ridge Regression Using Matrix Decompositions for Preconditioning ⋮ Subspace Iteration Randomization and Singular Value Problems ⋮ Sublinear Cost Low Rank Approximation via Subspace Sampling ⋮ Random multipliers numerically stabilize Gaussian and block Gaussian elimination: proofs and an extension to low-rank approximation
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A volume associated with \(m{\times}n\) matrices
- Rank revealing \(LU\) factorizations
- A theory of pseudoskeleton approximations
- Improved bound for rank revealing LU factorizations
- Manifestations of the Schur complement
- Bounds on singular values revealed by QR factorizations
- On the Existence and Computation of LU-Factorizations with Small Pivots
- Matrix Analysis
- Rank-Revealing QR Factorizations and the Singular Value Decomposition
- Computing rank-revealing QR factorizations of dense matrices
- Algorithm 782
- On Rank-Revealing Factorisations
- Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization
- The least squares problem and pseudo-inverses
This page was built for publication: On the existence and computation of rank-revealing LU factorizations
