Updating preconditioners for modified least squares problems
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1569025
- Preconditioners for rank deficient least squares problems
- A note on preconditioned iterative methods for least squares problems
- Updating incomplete factorization preconditioners for model order reduction
- Preconditioners for least squares problems by LU factorization
Cites work
- scientific article; zbMATH DE number 1953446 (Why is no real title available?)
- scientific article; zbMATH DE number 852536 (Why is no real title available?)
- A robust incomplete factorization preconditioner for positive definite matrices
- Analysis of a recursive least squares hyperbolic rotation algorithm for signal processing
- Computing the block triangular form of a sparse matrix
- ILUT: A dual threshold incomplete LU factorization
- Low-rank updates of balanced incomplete factorization preconditioners
- Modifying a Sparse Cholesky Factorization
- Multiple-rank modifications of a sparse Cholesky factorization
- Orderings for Incomplete Factorization Preconditioning of Nonsymmetric Problems
- Preconditioned iterative methods for solving linear least squares problems
- Row Modifications of a Sparse Cholesky Factorization
- The University of Florida sparse matrix collection
Cited in
(5)- Automatic Preconditioning by Limited Memory Quasi-Newton Updating
- scientific article; zbMATH DE number 1569025 (Why is no real title available?)
- Restrictively preconditioned conjugate gradient method for a series of constantly augmented least squares problems
- Preconditioners for rank deficient least squares problems
- Updating incomplete factorization preconditioners for model order reduction
This page was built for publication: Updating preconditioners for modified least squares problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2360681)