An algorithm for the construction of best approximations based on Kolmogorov's criterion

DOI10.1016/0021-9045(78)90082-5zbMath0417.41012OpenAlexW2071703311MaRDI QIDQ755062

Gerhard Opfer

Publication date: 1978

Published in: Journal of Approximation Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0021-9045(78)90082-5

zbMATH Keywords

Chebyshev polynomialsdescent algorithmcomplex approximationsbest Chebyshev approximationsKolmogorov criterion

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Best approximation, Chebyshev systems (41A50) Approximation in the complex plane (30E10) Algorithms for approximation of functions (65D15)

Related Items

Ein Abstiegsverfahren für Approximationsaufgaben in normierten Räumen, A New Method for Chebyshev Approximation of Complex-Valued Functions, New extremal properties for constructing conformal mappings, An Algorithm for Real and Complex Rational Minimax Approximation, A cutting plane method for solving minimax problems in the complex plane, A Fast Algorithm for Linear Complex Chebyshev Approximations, Complex Chebyshev polynomials on circular sectors, Chebyshev approximation problem of multidimensional IIR digital filters in the frequency domain

Cites Work

• Some new characterizations of the Chebyshev polynomials
• Some remarks on uniform asymptotic expansions for Bessel functions
• Complex Chebyshev polynomials on circular sectors
• Some Chebyshev approximations by polynomials in two variables
• Über die Approximation asymptotischer Entwicklungen. I
• Ein Pseudo-Gradientenverfahren zur Lösung des diskreten linearen Tschebyscheff-Problems
• Linear Chebyshev Approximation in the Complex Plane Using Lawson's Algorithm
• Rational Chebyshev Approximation in the Complex Plane
• Monotone Approximation by Algebraic Polynomials
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item