Joseph C. Simpson
Supplemental Material
Available for Download
gz
501.gz (6.3 KB)
best polynomial approximation to a discrete one-dimensional data set in the Chebyshev (minimax) sense Gams: K2
- SCHMITT, H. Discrete Chebychev curve fit, Algorithm 409. Comm. A CM I~, 5 (May 1971), 355-356. Google Scholar
Index Terms
- Algorithm 501: Fortran Translation of Algorithm 409, Discrete Chebychev Curve Fit [E2]
Recommendations
Algorithm 716: TSPACK: tension spline curve-fitting package
The primary purpose of TSPACK is to construct a smooth function which interpolates a discrete set of data points. The function may be required to have either one or two continuous derivatives. If the accuracy of the data does not warrant interpolation, ...
Fast algorithm for discrete fractional Hadamard transform
This paper proposes a fast algorithm for computing the discrete fractional Hadamard transform for the input vector of length N, being a power of two. A direct calculation of the discrete fractional Hadamard transform requires N 2 real multiplications, ...
Comments