The problem of optimization of trinomial iteration processes

DOI10.1007/BF00969191MaRDI QIDQ579839zbMATH OpenOpenAlexFDO

Authors A. V. Buledza

Publication date 1986

Published in Siberian Mathematical Journal (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf00969191

zbMATH Keywords

Chebyshev polynomialsrecurrent relationssemi-iterative methodssuccessive approximationstrinomial algorithms

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10)

Review text

The author studies algorithms for numerical solution of linear systems of equations based on application of recurrence relations for Chebyshev polynomials of the first kind.

Cites work

• scientific article; zbMATH DE number 3426794 (Why is no real title available?)
• scientific article; zbMATH DE number 3850376 (Why is no real title available?)
• scientific article; zbMATH DE number 3516528 (Why is no real title available?)
• On Richardson's Method for Solving Linear Systems with Positive Definite Matrices
• On the problem of spectral optimization of iterative methods

Cited in

(1)

• Current issues in the development of the theory of iterative methods with Chebyshev acceleration

This page was built for publication: The problem of optimization of trinomial iteration processes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q579839)