TOPICS
Search

Spectral Differentiation


Spectral differentiation approximates a derivative by differentiating a global expansion fitted to samples of a function (Trefethen 2000, Komarov et al. 2026).

For a smooth 2pi-periodic function sampled at x_j=2pij/(2m+1) for j=0, ..., 2m, the discrete Fourier transform gives coefficients c_k of a trigonometric interpolant. The differentiated interpolant is

 p^'(x)=sum_(k=-m)^mikc_ke^(ikx),

where p(x)=sum_(k=-m)^(m)c_ke^(ikx). Thus the derivative at the nodes can be obtained by multiplying each coefficient by ik and applying the inverse discrete Fourier transform.

On a bounded interval, a common alternative is to map the interval to [-1,1] and interpolate at x_j=cos(jpi/n) for j=0, ..., n, with n>=1. The interpolating polynomial can be expanded in Chebyshev polynomials of the first kind T_k(x) and differentiated using the derivative of each basis polynomial. The resulting derivative must be scaled by the chain rule when mapping back to the original interval.


See also

Chebyshev Polynomial of the First Kind, Discrete Fourier Transform, Numerical Differentiation

Explore with Wolfram|Alpha

References

Komarov, P.; van Breugel, F.; and Kutz, J. N. "A Taxonomy of Numerical Differentiation Methods." 17 Nov 2026. https://arxiv.org/abs/2512.09090v5.Trefethen, L. N. Spectral Methods in MATLAB. Philadelphia, PA: SIAM, 2000. https://doi.org/10.1137/1.9780898719598.

Cite this as:

Weisstein, Eric W. "Spectral Differentiation." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/SpectralDifferentiation.html

Subject classifications