Flexible modified LSMR for least squares problems
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 1953444 (Why is no real title available?)
- scientific article; zbMATH DE number 852536 (Why is no real title available?)
- A Flexible Inner-Outer Preconditioned GMRES Algorithm
- A Technique for Accelerating the Convergence of Restarted GMRES
- A least squares approach for saddle point problems
- Accuracy and Stability of Numerical Algorithms
- An alternative method for SPP with full rank (2,1)-block matrix and nonzero right-hand side vector
- Calculating the Singular Values and Pseudo-Inverse of a Matrix
- Convergence of inner-iteration GMRES methods for rank-deficient least squares problems
- Flexible GMRES with deflated restarting
- Flexible Inner-Outer Krylov Subspace Methods
- Flexible Krylov methods for \(\ell_p\) regularization
- Generalized Golub-Kahan bidiagonalization and stopping criteria
- Generalized Hybrid Iterative Methods for Large-Scale Bayesian Inverse Problems
- Heavy ball flexible GMRES method for nonsymmetric linear systems
- Inexact Preconditioned Conjugate Gradient Method with Inner-Outer Iteration
- Iterated preconditioned LSQR method for inverse problems on unstructured grids
- LSMR: An Iterative Algorithm for Sparse Least-Squares Problems
- LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
- Locally optimal and heavy ball GMRES methods
- MIQR: A Multilevel Incomplete QR Preconditioner for Large Sparse Least‐Squares Problems
- Optimal backward perturbation bounds for the linear least squares problem
- Using Perturbed QR Factorizations to Solve Linear Least-Squares Problems
This page was built for publication: Flexible modified LSMR for least squares problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6912400)
