Implementation of an adaptive algorithm for Richardson's method
From MaRDI portal
Publication:808615
DOI10.1016/0024-3795(91)90397-FzbMath0732.65022MaRDI QIDQ808615
Dennis C. Smolarski, Paul E. Saylor
Publication date: 1991
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
adaptive algorithmRichardson extrapolationGMRES methodtest problemsimplementationRichardson's methodconjugate gradient squared algorithm
Related Items
A hybrid Arnoldi-Faber iterative method for nonsymmetric systems of linear equations, A generalized ADI iterative method, A hybrid block GMRES method for nonsymmetric systems with multiple right-hand sides, Block jacobi preconditioning of the conjugate gradient method on a vector processor, A polynomial preconditioner for the CMRH algorithm, Convergence properties of block GMRES and matrix polynomials
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Adaptive procedure for estimating parameters for the nonsymmetric Tchebychev iteration
- Preconditioning strategies for models of incompressible flow
- The application of Leja points to Richardson iteration and polynomial preconditioning
- Richardson's iteration for nonsymmetric matrices
- A survey of preconditioned iterative methods for linear systems of algebraic equations
- Convergence of a two-stage Richardson process for nonlinear equations
- Iterationsverfahren für nichtsymmetrische Gleichungssysteme und Approximationsmethoden im Komplexen. (Iterative methods for nonsymmetric systems of equations and approximation methods in the complex domain)
- An optimum iterative method for solving any linear system with a square matrix
- A stable Richardson iteration method for complex linear systems
- Leapfrog variants of iterative methods for linear algebraic equations
- The convergence of inexact Chebyshev and Richardson iterative methods for solving linear systems
- s-step iterative methods for symmetric linear systems
- Stationary and almost stationary iterative (k,l)-step methods for linear and nonlinear systems of equations
- Adaptive polynomial preconditioning for Hermitian indefinite linear systems
- On the efficient implementation of preconditioned s-step conjugate gradient methods on multiprocessors with memory hierarchy
- Polynomial approximation of functions of matrices and applications
- Polynomials by Conformal Mapping for the Richardson Iteration Method for Complex Linear Systems
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- Practical Use of Polynomial Preconditionings for the Conjugate Gradient Method
- General k-Part Stationary Iterative Solutions to Linear Systems
- Computing the Roots of Complex Orthogonal and Kernel Polynomials
- CGS, A Fast Lanczos-Type Solver for Nonsymmetric Linear systems
- A Hybrid Chebyshev Krylov Subspace Algorithm for Solving Nonsymmetric Systems of Linear Equations
- Matrix-Free Methods for Stiff Systems of ODE’s
- On Richardson's Method for Solving Linear Systems with Positive Definite Matrices
