Extremal polynomials and methods of optimization of numerical algorithms
- Institute of Computational Mathematics of the Russian Academy of Sciences, Moscow (Russian Federation)
Chebyshev-Markov-Bernstein-Szegoe polynomials C{sub n}(x) extremal on [-1,1] with weight functions w(x)=(1+x){sup {alpha}}(1- x){sup {beta}}/{radical}(S{sub l}(x)) where {alpha},{beta}=0,1/2 and S{sub l}(x)={pi}{sub k=1}{sup m}(1-c{sub k}T{sub l{sub k}}(x))>0 are considered. A universal formula for their representation in trigonometric form is presented. Optimal distributions of the nodes of the weighted interpolation and explicit quadrature formulae of Gauss, Markov, Lobatto, and Rado types are obtained for integrals with weight p(x)=w{sup 2}(x)(1-x{sup 2}){sup -1/2}. The parameters of optimal Chebyshev iterative methods reducing the error optimally by comparison with the initial error defined in another norm are determined. For each stage of the Fedorenko-Bakhvalov method iteration parameters are determined which take account of the results of the previous calculations. Chebyshev filters with weight are constructed. Iterative methods of the solution of equations containing compact operators are studied.
- OSTI ID:
- 21260464
- Journal Information:
- Sbornik. Mathematics, Journal Name: Sbornik. Mathematics Journal Issue: 10 Vol. 195; ISSN 1064-5616
- Country of Publication:
- United States
- Language:
- English
Similar Records
Some numerical reslts on best uniform polynomial approximation of {chi}{sup {alpha}} on [0,1]
Some numerical reslts on best uniform polynomial approximation of. chi. sup. alpha. on (0,1)