Full rank Cholesky factorization for rank deficient matrices
From MaRDI portal
Recommendations
Cites work
- A Robust Preconditioner with Low Memory Requirements for Large Sparse Least Squares Problems
- Accuracy and Stability of Numerical Algorithms
- Full rank factorization and the Flanders theorem
- scientific article; zbMATH DE number 852536 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- Strong rank revealing Cholesky factorization
Cited in
(6)- Targeted principal components regression
- Robust Approximate Cholesky Factorization of Rank-Structured Symmetric Positive Definite Matrices
- On Using Cholesky-Based Factorizations and Regularization for Solving Rank-Deficient Sparse Linear Least-Squares Problems
- Matrix factorizations with prescribed ranges and null spaces
- Constructions of equi-norm tight frames with minimal completion
- Convolution-t distributions
This page was built for publication: Full rank Cholesky factorization for rank deficient matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2343690)