Minimization properties and short recurrences for Krylov subspace methods
zbMATH Open0809.65027MaRDI QIDQ1344409FDOQ1344409
Authors: Rüdiger Weiss 
Publication date: 12 February 1995
Published in: ETNA - Electronic Transactions on Numerical Analysis (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/118542
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Recommendations
convergenceKrylov subspace methodslinear systemsconjugate gradient methodsrecurrence methoditerative linear solvers
Computational methods for sparse matrices (65F50) Iterative numerical methods for linear systems (65F10)
Cited In (11)
- Limited memory restarted \(\ell^p\)-\(\ell^q\) minimization methods using generalized Krylov subspaces
- Error-Minimizing Krylov Subspace Methods
- A framework for generalized conjugate gradient methods -- with special emphasis on contributions by Rüdiger Weiß
- Short-term recurrence Krylov subspace methods for nearly Hermitian matrices
- Optimal left and right additive Schwarz preconditioning for minimal residual methods with Euclidean and energy norms
- Error Analysis of Krylov Methods In a Nutshell
- A theoretical overview of Krylov subspace methods
- Special issue: Developments and trends in iterative methods for large systems of equations -- in memoriam Rüdiger Weiss. Minisymposium: 16th IMACS world congress, Lausanne, Switzerland, August 21--25, 2000
- An engineering approach to generalized conjugate gradient methods and beyond
- On Optimal Short Recurrences for Generating Orthogonal Krylov Subspace Bases
- Accuracy of two three-term and three two-term recurrences for Krylov space solvers
This page was built for publication: Minimization properties and short recurrences for Krylov subspace methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1344409)
