language-icon Old Web
English
Sign In

Trigonometric interpolation

In mathematics, trigonometric interpolation is interpolation with trigonometric polynomials. Interpolation is the process of finding a function which goes through some given data points. For trigonometric interpolation, this function has to be a trigonometric polynomial, that is, a sum of sines and cosines of given periods. This form is especially suited for interpolation of periodic functions. p ( x ) = a 0 + ∑ k = 1 K a k cos ⁡ ( k x ) + ∑ k = 1 K b k sin ⁡ ( k x ) . {displaystyle p(x)=a_{0}+sum _{k=1}^{K}a_{k}cos(kx)+sum _{k=1}^{K}b_{k}sin(kx).,}     (1) p ( x ) = ∑ k = 0 2 K y k t k ( x ) , {displaystyle p(x)=sum _{k=0}^{2K}y_{k},t_{k}(x),}     (5) e i z 1 − e i z 2 = 2 i sin ⁡ ( z 1 − z 2 2 ) e i 1 2 z 1 + i 1 2 z 2 , {displaystyle e^{iz_{1}}-e^{iz_{2}}=2isin left({frac {z_{1}-z_{2}}{2}} ight)e^{i{frac {1}{2}}z_{1}+i{frac {1}{2}}z_{2}},}     (2) t k ( x ) = ∏ m = 0 , m ≠ k 2 K sin ⁡ 1 2 ( x − x m ) sin ⁡ 1 2 ( x k − x m ) . {displaystyle t_{k}(x)=prod _{m=0,m eq k}^{2K}{frac {sin {frac {1}{2}}(x-x_{m})}{sin {frac {1}{2}}(x_{k}-x_{m})}}.}     (4) p ( x ) = ∑ k = 0 2 K − 1 y k t k ( x ) , {displaystyle p(x)=sum _{k=0}^{2K-1}y_{k},t_{k}(x),}     (6) t k ( x ) = e − i K x + i K x k e i x − e i α k e i x k − e i α k ∏ m = 0 , m ≠ k 2 K − 1 e i x − e i x m e i x k − e i x m . {displaystyle t_{k}(x)=e^{-iKx+iKx_{k}}{frac {e^{ix}-e^{ialpha _{k}}}{e^{ix_{k}}-e^{ialpha _{k}}}}prod _{m=0,m eq k}^{2K-1}{frac {e^{ix}-e^{ix_{m}}}{e^{ix_{k}}-e^{ix_{m}}}}.}     (3) In mathematics, trigonometric interpolation is interpolation with trigonometric polynomials. Interpolation is the process of finding a function which goes through some given data points. For trigonometric interpolation, this function has to be a trigonometric polynomial, that is, a sum of sines and cosines of given periods. This form is especially suited for interpolation of periodic functions. An important special case is when the given data points are equally spaced, in which case the solution is given by the discrete Fourier transform. A trigonometric polynomial of degree K has the form This expression contains 2K + 1 coefficients, a0, a1, … aK, b1, …, bK, and we wish to compute those coefficients so that the function passes through N points: Since the trigonometric polynomial is periodic with period 2π, the N points can be distributed and ordered in one period as (Note that we do not in general require these points to be equally spaced.) The interpolation problem is now to find coefficients such that the trigonometric polynomial p satisfies the interpolation conditions. The problem becomes more natural if we formulate it in the complex plane. We can rewrite the formula for a trigonometric polynomial as p ( x ) = ∑ k = − K K c k e i k x , {displaystyle p(x)=sum _{k=-K}^{K}c_{k}e^{ikx},,} where i is the imaginary unit. If we set z = eix, then this becomes

[ "Spline interpolation", "Multivariate interpolation", "Bicubic interpolation", "Polynomial interpolation", "Nearest-neighbor interpolation" ]
Parent Topic
Child Topic
    No Parent Topic