Chebyshev polynomial iterations and approximate solutions of linear operator equations
From MaRDI portal
Summary: 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.
Recommendations
Cited in
(14)- Approximate solution of operator equations with regard to new properties of Chebyshev polynomials
- Quasi-iteration methods of Chebyshev type for the approximate solution of operator equations
- Finite alternation theorems and a constructive approach to piecewise polynomial approximation in Chebyshev norm
- scientific article; zbMATH DE number 4159986 (Why is no real title available?)
- scientific article; zbMATH DE number 3913595 (Why is no real title available?)
- scientific article; zbMATH DE number 4049963 (Why is no real title available?)
- scientific article; zbMATH DE number 63252 (Why is no real title available?)
- scientific article; zbMATH DE number 1263755 (Why is no real title available?)
- scientific article; zbMATH DE number 609991 (Why is no real title available?)
- scientific article; zbMATH DE number 1098935 (Why is no real title available?)
- scientific article; zbMATH DE number 1102835 (Why is no real title available?)
- On construction of the stable permutations of parameters for the Chebyshev iterative methods. Part I
- Some algorithms for computing Chebyshev normalized first-kind polynomials by roots
- On a numerical-analytical method for constructing extremal polynomials of a complex argument
This page was built for publication: Chebyshev polynomial iterations and approximate solutions of linear operator equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1340794)