Extremal polynomials and methods of optimization of numerical algorithms

DOI10.1070/SM2004V195N10ABEH000852MaRDI QIDQ5693782zbMATH OpenOpenAlexFDO

Authors 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

Chebyshev iterative methodsGauss quadrature formulaweighted interpolation

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 2127829
• A new method for determining the roots of polynomials of least deviation on a segment with weight and subject to additional conditions. Part I
• scientific article; zbMATH DE number 992922
• scientific article; zbMATH DE number 2121340
• An optimized iterative method for numerical solution of large systems of equations based on the extremal property of zeroes of Chebyshev polynomials

Cited in

(6)

• Modified Bernstein function and a uniform approximation of some rational fractions by polynomials
• On iterative evaluation of extrema of integrals of trigonometric polynomials
• scientific article; zbMATH DE number 2121340 (Why is no real title available?)
• Approximation Methods for Polynomial Optimization
• On a numerical-analytical method for constructing extremal polynomials of a complex argument
• 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

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