The Newton differential correction algorithm for rational Chebyshev approximation with constrained denominators

DOI10.1007/BF02143129zbMath0860.65006OpenAlexW2085180253WikidataQ104129331 ScholiaQ104129331MaRDI QIDQ2564503

Martin Gugat

Publication date: 24 April 1997

Published in: Numerical Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02143129

zbMATH Keywords

algorithmconvergencenumerical examplesrational Chebyshev approximationbest rational approximationsconstrained denominatorsNewton differential correction algorithm

Mathematics Subject Classification ID

Approximation by rational functions (41A20) Algorithms for approximation of functions (65D15)

Related Items (3)

An algorithm for Chebyshev approximation by rationals with constrained denominators ⋮ Convex semi-infinite parametric programming: Uniform convergence of the optimal value functions of discretized problems ⋮ Approximation in normed linear spaces

Cites Work

• Unnamed Item
• Unnamed Item
• The differential correction algorithm for generalized rational functions
• Uniform approximation by rational functions having restricted denominators
• Chebyshev approximation by rationals with constrained denominators
• An algorithm for Chebyshev approximation by rationals with constrained denominators
• Two new algorithms for rational approximation
• An Algorithm for General Restricted Rational Chebyshev Approximation
• Directional derivatives for the value-function in semi-infinite programming
• One-sided derivatives for the value function in convex parametric programming
• The Differential Correction Algorithm for Rational $\ell _\infty $-Approximation

This page was built for publication: The Newton differential correction algorithm for rational Chebyshev approximation with constrained denominators