Convergence analysis of GMRES methods for least squares problems
From MaRDI portal
Publication:2820563
DOI10.1007/978-3-540-46375-7_23zbMATH Open1344.65057OpenAlexW128760387MaRDI QIDQ2820563FDOQ2820563
Authors: Ken Hayami, Tokushi Ito
Publication date: 9 September 2016
Published in: Frontiers of Computational Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-46375-7_23
Recommendations
- GMRES methods for least squares problems
- Preconditioned GMRES methods for least squares problems
- Convergence of inner-iteration GMRES methods for rank-deficient least squares problems
- Preconditioned Conjugate Gradient Method and Generalized Successive Overrelaxation Method for the Least Squares Problems
- Accuracy of preconditioned CG-type methods for least squares problems.
Cites Work
Cited In (7)
- Title not available (Why is that?)
- GMRES convergence bounds for eigenvalue problems
- GMRES methods for least squares problems
- Ritz and harmonic Ritz values and the convergence of FOM and GMRES
- Title not available (Why is that?)
- Convergence of CG and GMRES on a tridiagonal Toeplitz linear system
- Convergence of inner-iteration GMRES methods for rank-deficient least squares problems
This page was built for publication: Convergence analysis of GMRES methods for least squares problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2820563)