The linear inequality method for rational approximation with interpolation

DOI10.1016/0377-0427(84)90045-1MaRDI QIDQ792554zbMATH OpenOpenAlexFDO

Authors Charles B. Dunham

Publication date 1984

Published in Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0377-0427(84)90045-1

zbMATH Keywords

Lagrange-type interpolatory constraintsrational minimax approximation

Mathematics Subject Classification ID

Interpolation in approximation theory (41A05) Approximation by rational functions (41A20) Best approximation, Chebyshev systems (41A50)

Review text

The linear inequality method for rational minimax approximation is extended to cover approximation under Lagrange-type interpolatory constraints. A further extension is made to rationals p/q with denominator restraints of the form \(0<u\leq q\leq v\).

Recommendations

• Stability of the linear inequality method for rational Chebyshev approximation
• Publication:3199977
• scientific article; zbMATH DE number 16799
• Explicit Nearly Optimal Linear Rational Approximation with Preassigned Poles
• scientific article; zbMATH DE number 4097962

Cites work

• A Comparison of Algorithms for Rational l ∞ Approximation
• Chebyshev approximation by rationals with constrained denominators
• scientific article; zbMATH DE number 3258269 (Why is no real title available?)
• Uniform approximation with constraints

Cited in

(3)

• Stability of the linear inequality method for rational Chebyshev approximation
• Linear rational interpolation and its application in approximation and boundary value problems
• A rational sinc method based on interpolation of highest derivatives

This page was built for publication: The linear inequality method for rational approximation with interpolation

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