Quasi-iteration methods of Chebyshev type for the approximate solution of operator equations

MaRDI QIDQ1904093zbMATH OpenFDO

Authors Vasiliy A. Prokhorov, A. B. Antonevich, Jürgen Appell, Peter P. Zabreĭko

Publication date 1 February 1996

Published in Rendiconti del Seminario Matematico della Università di Padova (Search for Journal in Brave)

Full work available at URL http://www.numdam.org/item?id=RSMUP_1995__93__127_0, https://eudml.org/doc/108351

Banach space Chebyshev quasi-iteration method convergence error estimates operator equation

Equations and inequalities involving linear operators, with vector unknowns (47A50) Numerical solutions to equations with linear operators (65J10)

Review text

The authors describe a general method for the approximate solution of the operator equation \(Ax= f\), where \(A\) is a bounded linear invertible operator in a Banach space \(X\). A Chebyshev quasi-iteration method is defined and basic convergence results as well as some error estimates are given. The method builds on the construction of a sequence of polynomials of \(A\) which approximates the operator \(A^{- 1}\) in the norm of \({\mathcal L}(X)\). The authors also discuss an effective algorithm for constructing a sequence of polynomials of \(A\) which tends to \(A^{- 1}\) with sharp Lyapunov exponent \(\exp[- g(0, \infty)]\). Some examples are given.

Recommendations

Cites work

Cited in

(6)

This page was built for publication: Quasi-iteration methods of Chebyshev type for the approximate solution of operator equations

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