Implementation of an adaptive algorithm for Richardson's method
From MaRDI portal
Publication:808615
DOI10.1016/0024-3795(91)90397-FzbMATH Open0732.65022MaRDI QIDQ808615FDOQ808615
Authors: Paul E. Saylor, Dennis C. Smolarski 
Publication date: 1991
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Recommendations
- An adaptive Richardson iteration method for indefinite linear systems
- Adaptive Richardson iteration based on Leja points
- Two-step variants of Richardson's iterative method
- scientific article; zbMATH DE number 1735439
- A modification of Richardson method for numerical solution of linear system of equations
implementationRichardson extrapolationadaptive algorithmGMRES methodtest problemsRichardson's methodconjugate gradient squared algorithm
Cites Work
- CGS, A Fast Lanczos-Type Solver for Nonsymmetric Linear systems
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- Title not available (Why is that?)
- Title not available (Why is that?)
- The convergence of inexact Chebyshev and Richardson iterative methods for solving linear systems
- Title not available (Why is that?)
- s-step iterative methods for symmetric linear systems
- On the efficient implementation of preconditioned s-step conjugate gradient methods on multiprocessors with memory hierarchy
- An optimum iterative method for solving any linear system with a square matrix
- Title not available (Why is that?)
- A Hybrid Chebyshev Krylov Subspace Algorithm for Solving Nonsymmetric Systems of Linear Equations
- Adaptive procedure for estimating parameters for the nonsymmetric Tchebychev iteration
- A survey of preconditioned iterative methods for linear systems of algebraic equations
- Practical Use of Polynomial Preconditionings for the Conjugate Gradient Method
- A stable Richardson iteration method for complex linear systems
- Polynomial approximation of functions of matrices and applications
- On Richardson's Method for Solving Linear Systems with Positive Definite Matrices
- Richardson's iteration for nonsymmetric matrices
- Preconditioning strategies for models of incompressible flow
- Matrix-Free Methods for Stiff Systems of ODE’s
- The application of Leja points to Richardson iteration and polynomial preconditioning
- Adaptive polynomial preconditioning for Hermitian indefinite linear systems
- Polynomials by Conformal Mapping for the Richardson Iteration Method for Complex Linear Systems
- 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)
- Leapfrog variants of iterative methods for linear algebraic equations
- Stationary and almost stationary iterative (k,l)-step methods for linear and nonlinear systems of equations
- General k-Part Stationary Iterative Solutions to Linear Systems
- Computing the Roots of Complex Orthogonal and Kernel Polynomials
Cited In (10)
- A polynomial preconditioner for the CMRH algorithm
- A generalized ADI iterative method
- Algorithm of Competing Processes for the Richardson Iteration Method with the Chebyshev Parameters
- Efficient implementation of stable Richardson extrapolation algorithms
- A hybrid block GMRES method for nonsymmetric systems with multiple right-hand sides
- Adaptive Richardson iteration based on Leja points
- Adaptive Preconditioned Variational Methods For Solving Self-Adjoint Partial Differential Equations
- Convergence properties of block GMRES and matrix polynomials
- A hybrid Arnoldi-Faber iterative method for nonsymmetric systems of linear equations
- Block jacobi preconditioning of the conjugate gradient method on a vector processor
Uses Software
This page was built for publication: Implementation of an adaptive algorithm for Richardson's method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q808615)
