
doi: 10.4171/zaa/484
An iteration scheme for the approximate solution of a linear operator equation in a Banach space is discussed from the viewpoint of Chebyshev polynomials. The optimal rate of convergence is described by numerical characteristics which are similar to (but different from) the classical Chebyshev constants. The abstract results are illustrated by some examples which frequently arise in applications.
polynomial iterations, Approximation by polynomials, Numerical solutions to equations with linear operators, Chebyshev polynomials, Equations and inequalities involving linear operators, with vector unknowns, 510, Chebyshev characteristics
polynomial iterations, Approximation by polynomials, Numerical solutions to equations with linear operators, Chebyshev polynomials, Equations and inequalities involving linear operators, with vector unknowns, 510, Chebyshev characteristics
| citations This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 2 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
