= Periodic N-point rectangle-rule error
{c}
{title2=$e_N(h)$}
For a two-periodic <function> $h$ with an absolutely convergent <Fourier series>, use $N$ samples $x_k=2k/N$, $0\leq k<N$. Write
$$
Q_N(h)=\frac2N\sum_{k=0}^{N-1}h(2k/N),\qquad I(h)=\int_0^2h(x)\,dx.
$$
Discrete averaging of each <Fourier mode> gives
$$
Q_N(h)=2\sum_{j\in\mathbb Z}\widehat h_{jN},\qquad e_N(h)=I(h)-Q_N(h)=-2\sum_{j\ne0}\widehat h_{jN}.
$$
This grid works for both odd and even positive $N$; no half-integer summation endpoints are needed. If $|\widehat h_m|\leq Mc^{|m|}$, $0<c<1$, a <geometric series> bounds $|e_N|\leq4Mc^N/(1-c^N)$. The sign convention here is exact <integral> minus quadrature, whereas the normalized-average convention in <periodic trapezoidal Fourier aliasing> uses approximation minus exact average.
Back to article page