Improved bound for rank revealing LU factorizations
From MaRDI portal
Publication:1362659
Recommendations
- Rank revealing \(LU\) factorizations
- On the existence and computation of rank-revealing LU factorizations
- Strong rank revealing LU factorizations
- On Rank-Revealing Factorisations
- Improved bounds for the implicit factorization problem
- A randomized blocked algorithm for efficiently computing rank-revealing factorizations of matrices
- New lower bounds for the rank of matrix multiplication
- Bounds for elements of LU factorizations of sparse matrices and their application to incomplete factorization methods
- Improved rigorous perturbation bounds for the LU and QR factorizations.
- Towards optimal bounds for implicit factorization problem
Cites work
- scientific article; zbMATH DE number 4213315 (Why is no real title available?)
- Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization
- Error Analysis of Direct Methods of Matrix Inversion
- Numerical methods for solving linear least squares problems
- On Rank-Revealing Factorisations
- On the Existence and Computation of LU-Factorizations with Small Pivots
- Rang revealing QR factorizations
- Rank Detection Methods for Sparse Matrices
- Rank revealing \(LU\) factorizations
- Rank-Revealing QR Factorizations and the Singular Value Decomposition
- Some Applications of the Rank Revealing QR Factorization
- Sparse Multifrontal Rank Revealing QR Factorization
- Structure-Preserving and Rank-Revealing QR-Factorizations
- The Bordering Algorithm and Path Following Near Singular Points of Higher Nullity
- The Probability of Large Diagonal Elements in the $QR$ Factorization
Cited in
(5)- Perturbations of the \textsc{Tcur} decomposition for tensor valued data in the Tucker format
- scientific article; zbMATH DE number 1735440 (Why is no real title available?)
- Strong rank revealing LU factorizations
- On the existence and computation of rank-revealing LU factorizations
- Rank revealing \(LU\) factorizations
This page was built for publication: Improved bound for rank revealing LU factorizations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1362659)