On the existence and computation of rank-revealing LU factorizations
From MaRDI portal
Publication:1587285
DOI10.1016/S0024-3795(00)00120-8zbMATH Open0962.65023WikidataQ114122594 ScholiaQ114122594MaRDI QIDQ1587285FDOQ1587285
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
Direct numerical methods for linear systems and matrix inversion (65F05) Numerical solutions to overdetermined systems, pseudoinverses (65F20)
Cites Work
- Algorithm 782
- Matrix Analysis
- Title not available (Why is that?)
- A theory of pseudoskeleton approximations
- Title not available (Why is that?)
- Manifestations of the Schur complement
- Title not available (Why is that?)
- Computing rank-revealing QR factorizations of dense matrices
- The least squares problem and pseudo-inverses
- Title not available (Why is that?)
- A volume associated with \(m{\times}n\) matrices
- On Rank-Revealing Factorisations
- Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization
- Rank-Revealing QR Factorizations and the Singular Value Decomposition
- On the Existence and Computation of LU-Factorizations with Small Pivots
- Rank revealing \(LU\) factorizations
- Bounds on singular values revealed by QR factorizations
- Title not available (Why is that?)
- Improved bound for rank revealing LU factorizations
Cited In (48)
- Numerical approximation of multiple isolated roots of analytical systems
- Rank revealing Gaussian elimination by the maximum volume concept
- Mechanism free domain decomposition
- Random multipliers numerically stabilize Gaussian and block Gaussian elimination: proofs and an extension to low-rank approximation
- Strong rank revealing LU factorizations
- 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
- The Computation of Low Multilinear Rank Approximations of Tensors via Power Scheme and Random Projection
- Sublinear Cost Low Rank Approximation via Subspace Sampling
- A Fast Algorithm for Computing Macaulay Null Spaces of Bivariate Polynomial Systems
- Randomized LU decomposition using sparse projections
- An \(\mathcal O(N\log N)\) fast direct solver for partial hierarchically semi-separable matrices. With application to radial basis function interpolation
- Implementation of an interior point method with basis preconditioning
- Pass-efficient randomized LU algorithms for computing low-rank matrix approximation
- Optimal sensors placement in dynamic damage detection of beams using a statistical approach
- Simpler is better: a comparative study of randomized pivoting algorithms for CUR and interpolative decompositions
- Numerically safe Gaussian elimination with no pivoting
- Fast and Accurate Gaussian Kernel Ridge Regression Using Matrix Decompositions for Preconditioning
- Subspace Iteration Randomization and Singular Value Problems
- Exact expressions for the Drazin inverse of anti-triangular matrices
- Strong rank revealing Cholesky factorization
- On the accuracy of cross and column low-rank maxvol approximations in average
- Optimal CUR Matrix Decompositions
- On selecting a maximum volume sub-matrix of a matrix and related problems
- Maximal volume matrix cross approximation for image compression and least squares solution
- A fast and stable algorithm for downdating the singular value decomposition
- Fast multipole preconditioners for sparse matrices arising from elliptic equations
- New studies of randomized augmentation and additive preprocessing
- Single-pass randomized algorithms for LU decomposition
- Solving linear systems of equations with randomization, augmentation and aggregation
- Cholesky decomposition of a positive semidefinite matrix with known kernel
- A fast memory efficient construction algorithm for hierarchically semi-separable representations
- Randomized LU decomposition
- Cholesky decomposition with fixing nodes to stable computation of a generalized inverse of the stiffness matrix of a floating structure
- Title not available (Why is that?)
- Time and space efficient generators for quasiseparable matrices
- An Accelerated Divide-and-Conquer Algorithm for the Bidiagonal SVD Problem
- Polynomial time \(\rho\)-locally maximum volume search
- New fast divide-and-conquer algorithms for the symmetric tridiagonal eigenvalue problem
- Title not available (Why is that?)
- About noneigenvector source localization methods
- Rank revealing \(LU\) factorizations
- Properties of the CMP inverse and its computation
- Improved bound for rank revealing LU factorizations
- On maximum volume submatrices and cross approximation for symmetric semidefinite and diagonally dominant matrices
- 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
- Exponential inapproximability of selecting a maximum volume sub-matrix
Uses Software
Recommendations
This page was built for publication: On the existence and computation of rank-revealing LU factorizations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1587285)
