Efficiency of a Procedure for Near-Minimax Approximation

DOI10.1145/321607.321614MaRDI QIDQ5626101zbMATH OpenOpenAlexFDO

Authors L. F. Shampine

Publication date 1970

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/321607.321614

Mathematics Subject Classification ID

Numerical interpolation (65D05) Algorithms for approximation of functions (65D15)

Cited in

(4)

• Comparisons between best polynomial approximations and interpolating polynomials
• On the sensitivity to rounding errors of Chebyshev series approximations
• Convergence of interpolation in polynomial Chebyshev approximation
• The numerical evaluation of a class of logarithmically singular integral transforms

This page was built for publication: Efficiency of a Procedure for Near-Minimax Approximation

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