Extremal polynomials and methods of optimization of numerical algorithms

DOI10.1070/SM2004v195n10ABEH000852zbMath1074.41022OpenAlexW1973727459MaRDI QIDQ5693782

V. I. Lebedev

Publication date: 28 September 2005

Published in: Sbornik: Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1070/sm2004v195n10abeh000852

zbMATH Keywords

weighted interpolationGauss quadrature formulaChebyshev iterative methods

Mathematics Subject Classification ID

Best approximation, Chebyshev systems (41A50) Numerical interpolation (65D05) Approximation by polynomials (41A10) Numerical integration (65D30)

Related Items (2)

Modified Bernstein function and a uniform approximation of some rational fractions by polynomials ⋮ Approximation of \(\operatorname{sgn} (x)\) on two symmetric intervals by rational functions with fixed poles

This page was built for publication: Extremal polynomials and methods of optimization of numerical algorithms