A generalization of \(s\)-step variants of gradient methods
From MaRDI portal
Publication:415206
DOI10.1016/j.cam.2012.01.028zbMath1237.65031OpenAlexW2139719018MaRDI QIDQ415206
G. Casal, J. A. Alvarez-Dios, José C. Cabaleiro
Publication date: 11 May 2012
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2012.01.028
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Parallel iterative S-step methods for unsymmetric linear systems
- s-step iterative methods for symmetric linear systems
- The stable \(A^TA\)-orthogonal \(s\)-step orthomin\((k)\) algorithm with the CADNA library
- Conjugate gradient type methods for unsymmetric and inconsistent systems of linear equations
- A block variant of the GMRES method on massively parallel processors
- On the efficient implementation of preconditioned s-step conjugate gradient methods on multiprocessors with memory hierarchy
- Block s-step Krylov iterative methods
- Minimizing Communication in Numerical Linear Algebra
- Présentation de synthèse des méthodes de gradient conjugué
- s-Step Iterative Methods for (Non)Symmetric (In)Definite Linear Systems
- Basic Linear Algebra Subprograms for Fortran Usage
- Iterative solution of large linear systems with non-smooth submatrices using partial wavelet transforms and split-matrix matrix–vector multiplication
This page was built for publication: A generalization of \(s\)-step variants of gradient methods
