Algorithm 501: Fortran Translation of Algorithm 409, Discrete Chebychev Curve Fit [E2]

DOI10.1145/355666.355674MaRDI QIDQ4079067zbMATH OpenOpenAlexWikidataFDO

Authors Joseph C. Simpson

Publication date 1976

Published in ACM Transactions on Mathematical Software (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Approximation by polynomials (41A10) Numerical smoothing, curve fitting (65D10) Algorithms in computer science (68W99)

Cited in

(2)

• A survey of published programs for best approximation
• Barycentric-Remez algorithms for best polynomial approximation in the chebfun system

Describes a project that uses

Uses Software

• APPROX/EXCH

This page was built for publication: Algorithm 501: Fortran Translation of Algorithm 409, Discrete Chebychev Curve Fit [E2]

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