On the existence and computation of rank-revealing LU factorizations
From MaRDI portal
(Redirected from Publication:1587285)
Recommendations
Cites work
- scientific article; zbMATH DE number 4213315 (Why is no real title available?)
- scientific article; zbMATH DE number 1226426 (Why is no real title available?)
- scientific article; zbMATH DE number 1049347 (Why is no real title available?)
- scientific article; zbMATH DE number 782069 (Why is no real title available?)
- scientific article; zbMATH DE number 4189084 (Why is no real title available?)
- A theory of pseudoskeleton approximations
- A volume associated with \(m{\times}n\) matrices
- Algorithm 782
- Bounds on singular values revealed by QR factorizations
- Computing rank-revealing QR factorizations of dense matrices
- Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization
- Improved bound for rank revealing LU factorizations
- Manifestations of the Schur complement
- Matrix Analysis
- On Rank-Revealing Factorisations
- On the Existence and Computation of LU-Factorizations with Small Pivots
- Rank revealing \(LU\) factorizations
- Rank-Revealing QR Factorizations and the Singular Value Decomposition
- The least squares problem and pseudo-inverses
Cited in
(48)- The Computation of Low Multilinear Rank Approximations of Tensors via Power Scheme and Random Projection
- Maximal volume matrix cross approximation for image compression and least squares solution
- Fast and Accurate Gaussian Kernel Ridge Regression Using Matrix Decompositions for Preconditioning
- Cholesky decomposition of a positive semidefinite matrix with known kernel
- Strong rank revealing Cholesky factorization
- New fast divide-and-conquer algorithms for the symmetric tridiagonal eigenvalue problem.
- On maximum volume submatrices and cross approximation for symmetric semidefinite and diagonally dominant matrices
- Low rank approximation of binary matrices: column subset selection and generalizations
- A fast memory efficient construction algorithm for hierarchically semi-separable representations
- Numerical approximation of multiple isolated roots of analytical systems
- On the accuracy of cross and column low-rank maxvol approximations in average
- Polynomial time \(\rho\)-locally maximum volume search
- Improved bound for rank revealing LU factorizations
- An \(\mathcal O(N\log N)\) fast direct solver for partial hierarchically semi-separable matrices. With application to radial basis function interpolation
- Randomized LU decomposition
- Pass-efficient randomized LU algorithms for computing low-rank matrix approximation
- Rank revealing Gaussian elimination by the maximum volume concept
- Single-pass randomized algorithms for LU decomposition
- A fast and stable algorithm for downdating the singular value decomposition
- Optimal sensors placement in dynamic damage detection of beams using a statistical approach
- Cholesky decomposition with fixing nodes to stable computation of a generalized inverse of the stiffness matrix of a floating structure
- Computing \(\{2,4\}\) and \(\{2,3\}\)-inverses by using the Sherman-Morrison formula
- Subspace Iteration Randomization and Singular Value Problems
- Exact expressions for the Drazin inverse of anti-triangular matrices
- Simpler is better: a comparative study of randomized pivoting algorithms for CUR and interpolative decompositions
- On the Existence and Computation of LU-Factorizations with Small Pivots
- Exponential inapproximability of selecting a maximum volume sub-matrix
- Mechanism free domain decomposition
- Numerically safe Gaussian elimination with no pivoting
- scientific article; zbMATH DE number 4592 (Why is no real title available?)
- Implementation of an interior point method with basis preconditioning
- Solving linear systems of equations with randomization, augmentation and aggregation
- Low Rank Approximation of a Sparse Matrix Based on LU Factorization with Column and Row Tournament Pivoting
- About noneigenvector source localization methods
- Strong rank revealing LU factorizations
- Fast multipole preconditioners for sparse matrices arising from elliptic equations
- New studies of randomized augmentation and additive preprocessing
- A Fast Algorithm for Computing Macaulay Null Spaces of Bivariate Polynomial Systems
- Rank revealing \(LU\) factorizations
- Parallel cross interpolation for high-precision calculation of high-dimensional integrals
- An accelerated divide-and-conquer algorithm for the bidiagonal SVD problem
- Introduction to communication avoiding algorithms for direct methods of factorization in linear algebra
- Randomized LU decomposition using sparse projections
- Time and space efficient generators for quasiseparable matrices
- Sublinear Cost Low Rank Approximation via Subspace Sampling
- Properties of the CMP inverse and its computation
- On selecting a maximum volume sub-matrix of a matrix and related problems
- Random multipliers numerically stabilize Gaussian and block Gaussian elimination: proofs and an extension to low-rank approximation
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)
