Two-sided preconditioned CGLS for the solution of factorized linear systems
From MaRDI portal
Cites work
- A generalized conjugate gradient, least square method
- A geometric view of Krylov subspace methods on singular systems.
- A randomised iterative method for solving factorised linear systems
- Are sketch-and-precondition least squares solvers numerically stable?
- Blendenpik: Supercharging LAPACK's Least-Squares Solver
- Faster kernel ridge regression using sketching and preconditioning
- scientific article; zbMATH DE number 1953444 (Why is no real title available?)
- Iterative Hessian sketch: fast and accurate solution approximation for constrained least-squares
- Iterative Methods for Solving Factorized Linear Systems
- Low-rank approximation and regression in input sparsity time
- LSRN: A parallel iterative solver for strongly over- or underdetermined systems
- Modified incomplete orthogonal factorization methods using Givens rotations
- Numerical study on incomplete orthogonal factorization preconditioners
- On the Convergence of the Conjugate Gradient Method for Singular Linear Operator Equations
- Practical sketching algorithms for low-rank matrix approximation
- Preconditioned GMRES methods with incomplete Givens orthogonalization method for large sparse least-squares problems
- Regularized randomized iterative algorithms for factorized linear systems
- Sketching as a tool for numerical linear algebra
- Weighted SGD for _p regression with randomized preconditioning
This page was built for publication: Two-sided preconditioned CGLS for the solution of factorized linear systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6894377)
