Leapfrog variants of iterative methods for linear algebraic equations

DOI10.1016/0377-0427(88)90351-2zbMath0659.65026OpenAlexW1991633120MaRDI QIDQ1112547

Paul E. Saylor

Publication date: 1988

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-0427(88)90351-2

zbMATH Keywords

numerical examplesiterative methodsupercomputersleapfrog methodRichardson's methodsecond order methodgrand-leap method

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10)

Related Items (8)

A hybrid iterative method for symmetric positive definite linear systems ⋮ Adaptive Richardson iteration based on Leja points ⋮ An adaptive Richardson iteration method for indefinite linear systems ⋮ Parallelizable restarted iterative methods for nonsymmetric linear systems. part I: Theory ⋮ An efficient nonsymmetric Lanczos method on parallel vector computers ⋮ Adaptive polynomial preconditioning for Hermitian indefinite linear systems ⋮ A hybrid iterative method for symmetric indefinite linear systems ⋮ Implementation of an adaptive algorithm for Richardson's method

Uses Software

• CHEBYCODE

Cites Work

• Unnamed Item
• Unnamed Item
• Adaptive procedure for estimating parameters for the nonsymmetric Tchebychev iteration
• The Tchebychev iteration for nonsymmetric linear systems
• Polynomial Preconditioners for Conjugate Gradient Calculations
• Computing the Roots of Complex Orthogonal and Kernel Polynomials
• Solution of Partial Differential Equations on Vector and Parallel Computers
• On Generating Orthogonal Polynomials
• Calculation of Gauss Quadrature Rules

This page was built for publication: Leapfrog variants of iterative methods for linear algebraic equations