Revisiting \((k,\ell)\)-step methods
From MaRDI portal
Publication:2351495
DOI10.1007/s11075-014-9906-0zbMath1317.65119OpenAlexW2007244734MaRDI QIDQ2351495
Publication date: 23 June 2015
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11075-014-9906-0
iterative methodlinear equationsnonlinear equationsKrylov subspace methodinduced dimension reductionsemiiterative methodconjugate gradient-type methods\((k,\ell)\)-step method\((s,t)\)-recursion
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- IDR explained
- A study of semiiterative methods for nonsymmetric systems of linear equations
- k-step iterative methods for solving nonlinear systems of equations
- Iterative k-step methods for computing possibly repulsive fixed points in Banach spaces
- Generalized conjugate-gradient acceleration of nonsymmetrizable iterative methods
- The analysis of k-step iterative methods for linear systems from summability theory
- Stationary and almost stationary iterative (k,l)-step methods for linear and nonlinear systems of equations
- Positive definite Toeplitz matrices, the Arnoldi process for isometric operators, and Gaussian quadrature on the unit circle
- On the construction of iteration methods for linear equations in Banach spaces by summation methods
- Iterationsverfahren und allgemeine Euler-Verfahren. (Iterative and general Euler methods)
- The Arnoldi process, short recursions, and displacement ranks
- Accuracy of Two Three-term and Three Two-term Recurrences for Krylov Space Solvers
- Eigenvalue Computations Based on IDR
- Necessary and Sufficient Conditions for the Existence of a Conjugate Gradient Method
- The question of non-self-adjoint extension of the conjugate gradients method is closed
- On Optimal Short Recurrences for Generating Orthogonal Krylov Subspace Bases
- IDR(s): A Family of Simple and Fast Algorithms for Solving Large Nonsymmetric Systems of Linear Equations
- The Faber–Manteuffel Theorem for Linear Operators
- Conjugate Gradient-Like Algorithms for Solving Nonsymmetric Linear Systems
- General k-Part Stationary Iterative Solutions to Linear Systems
- Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
- Changing the Norm in Conjugate Gradient Type Algorithms
- Solution of Sparse Indefinite Systems of Linear Equations
- Estimating the Attainable Accuracy of Recursively Computed Residual Methods
- Orthogonal Error Methods
- A fast minimal residual algorithm for shifted unitary matrices
- Multiple Recursion Conjugate Gradient Algorithms Part I: Sufficient Conditions
- Methods of conjugate gradients for solving linear systems
This page was built for publication: Revisiting \((k,\ell)\)-step methods
