Two new algorithms for rational approximation

DOI10.1007/BF01386002zbMath0114.32804OpenAlexW2031219349MaRDI QIDQ2625413

E. W. Cheney, Henry L. Loeb

Publication date: 1961

Published in: Numerische Mathematik (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/131474

zbMATH Keywords

numerical analysis

Related Items

An interior-point method for multifractional programs with convex constraints ⋮ The differential correction algorithm for generalized rational functions ⋮ On the optimum approximation of real rational functions via linear programming ⋮ An algorithm for Chebyshev approximation by rationals with constrained denominators ⋮ Rational Minimax Approximation via Adaptive Barycentric Representations ⋮ Unnamed Item ⋮ Uniform approximation by rational functions having restricted denominators ⋮ Algorithms for generalized fractional programming ⋮ Approximation with reciprocals of polynomials on compact sets ⋮ An algorithm for best rational approximation based on barycentric rational interpolation ⋮ Tschebyscheff-Approximation im Bereich der rationalen Funktionen bei Vorliegen einer guten Ausgangsnäherung ⋮ Die konstruktive Ermittlung der Tschebyscheff-Approximierenden im Bereich der rationalen Funktionen ⋮ An algorithm for simultaneous magnitude and phase approximation of bivariate rational polynomials ⋮ On rational Chebyshev approximation ⋮ Chebyshev approximation by rationals with constrained denominators ⋮ The Newton differential correction algorithm for rational Chebyshev approximation with constrained denominators ⋮ Approximation in normed linear spaces ⋮ Uniform reciprocal approximation subject to linear constraints

Cites Work

• Unnamed Item
• A finite algorithm for the solution of consistent linear equations and inequalities and for the Tchebycheff approximation of inconsistent linear equations
• Algorithms for Chebyshev Approximations Using the Ratio of Linear Forms
• Methods for Fitting Rational Approximations, Part I: Telescoping Procedures for Continued Fractions