Algorithm 501: Fortran Translation of Algorithm 409, Discrete Chebychev Curve Fit [E2]
From MaRDI portal
Publication:4079067
DOI10.1145/355666.355674zbMath0317.68047OpenAlexW2083245813WikidataQ113766660 ScholiaQ113766660MaRDI QIDQ4079067
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
Numerical smoothing, curve fitting (65D10) Approximation by polynomials (41A10) Algorithms in computer science (68W99)
Related Items (2)
Barycentric-Remez algorithms for best polynomial approximation in the chebfun system ⋮ A survey of published programs for best approximation
Uses Software
This page was built for publication: Algorithm 501: Fortran Translation of Algorithm 409, Discrete Chebychev Curve Fit [E2]