Utilization of ordered chebyshev parameters in iterative methods

DOI10.1016/0041-5553(76)90007-0zbMath0357.65043OpenAlexW2079387088MaRDI QIDQ4130314

V. I. Lebedev, S. A. Finogenov

Publication date: 1977

Published in: USSR Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0041-5553(76)90007-0

Mathematics Subject Classification ID

General theory of numerical analysis in abstract spaces (65J05)

Related Items (5)

Deriving efficient optimization methods based on stable explicit numerical methods ⋮ A class of high-order Runge-Kutta-Chebyshev stability polynomials ⋮ A stable Richardson iteration method for complex linear systems ⋮ Polynomial acceleration of iterative schemes associated with subproper splittings ⋮ The application of Leja points to Richardson iteration and polynomial preconditioning

This page was built for publication: Utilization of ordered chebyshev parameters in iterative methods