Algorithm 1062: code generation for piecewise Chebyshev approximation
From MaRDI portal
Cites work
- Accuracy and Stability of Numerical Algorithms
- Approximation theory and approximation practice
- Elementary functions. Algorithms and implementation
- Fast and correctly rounded logarithms in double-precision
- From Electrostatics to Almost Optimal Nodal Sets for Polynomial Interpolation in a Simplex
- Handbook of floating-point arithmetic
- scientific article; zbMATH DE number 48688 (Why is no real title available?)
- scientific article; zbMATH DE number 1052006 (Why is no real title available?)
- scientific article; zbMATH DE number 1862742 (Why is no real title available?)
- scientific article; zbMATH DE number 3273551 (Why is no real title available?)
- Implementing Clenshaw-Curtis quadrature, I methodology and experience
- NIST handbook of mathematical functions
- Numerical mathematics
- Numerical Methods for Special Functions
- Numerical Methods in Scientific Computing, Volume I
- Power series for the half width of the Voigt function, rederived
- Six myths of polynomial interpolation and quadrature
- The Chebyshev points of the first kind
This page was built for publication: Algorithm 1062: code generation for piecewise Chebyshev approximation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7311644)