Strong rank revealing LU factorizations

DOI10.1016/S0024-3795(02)00572-4zbMath1020.65016MaRDI QIDQ1873693

L. Miranian, Ming Gu

Publication date: 27 May 2003

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

zbMATH Keywords

singular valuesQR decompositionpivoting strategysingular value decompositionsrank revealingbackward stabilityLU decompositionnumerical rank

Mathematics Subject Classification ID

Numerical solutions to overdetermined systems, pseudoinverses (65F20) Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items (25)

Perturbations of the \textsc{Tcur} decomposition for tensor valued data in the Tucker format ⋮ Large-scale stochastic linear inversion using hierarchical matrices. Illustrated with an application to crosswell tomography in seismic imaging ⋮ An Accelerated Divide-and-Conquer Algorithm for the Bidiagonal SVD Problem ⋮ 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 ⋮ An Improved Analysis and Unified Perspective on Deterministic and Randomized Low-Rank Matrix Approximation ⋮ A Fast Algorithm for Computing Macaulay Null Spaces of Bivariate Polynomial Systems ⋮ An Algebraic Sparsified Nested Dissection Algorithm Using Low-Rank Approximations ⋮ Optimal CUR Matrix Decompositions ⋮ 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 ⋮ Analytical Low-Rank Compression via Proxy Point Selection ⋮ About noneigenvector source localization methods ⋮ Introduction to Communication Avoiding Algorithms for Direct Methods of Factorization in Linear Algebra ⋮ Low-Rank Factorizations in Data Sparse Hierarchical Algorithms for Preconditioning Symmetric Positive Definite Matrices ⋮ Randomized LU decomposition using sparse projections ⋮ A Fast Memory Efficient Construction Algorithm for Hierarchically Semi-Separable Representations ⋮ Presolve Reductions in Mixed Integer Programming ⋮ Single-pass randomized algorithms for LU decomposition ⋮ On maximum volume submatrices and cross approximation for symmetric semidefinite and diagonally dominant matrices ⋮ Fast and Accurate Gaussian Kernel Ridge Regression Using Matrix Decompositions for Preconditioning ⋮ Subspace Iteration Randomization and Singular Value Problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A direct method for the solution of sparse linear least squares problems
• Rank revealing \(LU\) factorizations
• Improved bound for rank revealing LU factorizations
• On the existence and computation of rank-revealing LU factorizations
• Bounds on singular values revealed by QR factorizations
• Numerical methods for solving linear least squares problems
• Handbook series linear algebra. Linear least squares solutions by Householder transformations
• Generalized Deflated Block-Elimination
• Sparse Multifrontal Rank Revealing QR Factorization
• The Bordering Algorithm and Path Following Near Singular Points of Higher Nullity
• On the Existence and Computation of LU-Factorizations with Small Pivots
• Expected Conditioning
• Rank-Revealing QR Factorizations and the Singular Value Decomposition
• On Rank-Revealing Factorisations
• Complete Orthogonal Decomposition for Weighted Least Squares
• Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization
• Updating a Rank-Revealing ULV Decomposition
• The least squares problem and pseudo-inverses
• Numerical Linear Algebra

This page was built for publication: Strong rank revealing LU factorizations