How well do fast discrete trigonometric transforms work for parametric numerical integration?
Abstract
The fast Fourier transform (FFT) and its real counterparts, the fast algorithms of the discrete cosine transform (DCT) and the discrete sine transform (DST), are frequently employed for the numerical evaluation of the Fourier cosine and Fourier sine transform, thereby acting as parametric quadrature rules based on finitely many samples of a given continuous function. But how accurate are the obtained results? In this paper we study the error occurring if the DCT of type I (DCT-I) and the DST of type I (DST-I) are applied to compute ∫0∞ f(x)cos(2πxv)d x and ∫0∞ f(x)sin(2πxv)d x for f ∈ L1(Rp) ∩ C(Rp) and v ∈ Rp, as well as the error occurring if the Chebyshev coefficients 2/π∫0π h(cosθ) cos(nθ)dθ, n ∈ Np, of a function h ∈ C(I) on I := [−1,1] are computed by the DCT-I. We present practicable, explicit error estimates under polynomial, exponential, and mixed decay conditions. For the Fourier cosine and sine transform, rational functions lead to a geometric decay in the frequency parameter P combined with an algebraic plateau of order L−3/2 in the sampling parameter L, while for meromorphic functions such as sech(π ·) the critical geometric rate is attained in both parameters. For Chebyshev approximation of a rational function with simple poles in C ∖ I, the quadrature error has the critical geometric rate ρ0−P with an explicit constant, where ρ0 > 1 is the parameter of the largest Bernstein ellipse of analyticity. Several numerical examples illustrate the theory.
Related
- On non-uniqueness of phase retrieval for continuous and discrete Fourier transforms
- Dual Quaternion Discrete Linear Canonical Transforms: FFT-Based Fast Algorithms and Joint Rotation--Translation Pose Denoising
- Optimal dimension-dependent ℓp and ℓ1,∞ estimates of the second-order discrete Riesz transforms
- A Low-rank ADI Algorithm for the Numerical Solution of Large Discrete-time Non-symmetric Algebraic Riccati Equations
- A higher order lattice-based method for high-dimensional numerical integration using periodization
BibTeX
@misc{plonka2026well,
title = {{How well do fast discrete trigonometric transforms work for parametric numerical integration?}},
author = {Gerlind Plonka and Daniel Potts and Manfred Tasche},
howpublished = {arXiv},
year = {2026},
month = sep,
doi = {10.48550/arxiv.2609.15577},
eprint = {2609.15577},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2609.15577},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - How well do fast discrete trigonometric transforms work for parametric numerical integration?
AU - Gerlind Plonka
AU - Daniel Potts
AU - Manfred Tasche
PY - 2026
DA - 2026/09/14
PB - arXiv
DO - 10.48550/arxiv.2609.15577
UR - https://arxiv.org/abs/2609.15577
AB - The fast Fourier transform (FFT) and its real counterparts, the fast algorithms of the discrete cosine transform (DCT) and the discrete sine transform (DST), are frequently employed for the numerical evaluation of the Fourier cosine and Fourier sine transform, thereby acting as parametric quadrature rules based on finitely many samples of a given continuous function. But how accurate are the obtained results? In this paper we study the error occurring if the DCT of type I (DCT-I) and the DST of type I (DST-I) are applied to compute ∫_0^∞ f(x)cos(2πxv)d x and ∫_0^∞ f(x)sin(2πxv)d x for f ∈ L^1(Rp) ∩ C(Rp) and v ∈ Rp, as well as the error occurring if the Chebyshev coefficients 2/π∫_0^π h(cosθ) cos(nθ)dθ, n ∈ Np, of a function h ∈ C(I) on I := [−1,1] are computed by the DCT-I. We present practicable, explicit error estimates under polynomial, exponential, and mixed decay conditions. For the Fourier cosine and sine transform, rational functions lead to a geometric decay in the frequency parameter P combined with an algebraic plateau of order L^−3/2 in the sampling parameter L, while for meromorphic functions such as sech(π ·) the critical geometric rate is attained in both parameters. For Chebyshev approximation of a rational function with simple poles in C ∖ I, the quadrature error has the critical geometric rate ρ_0^−P with an explicit constant, where ρ_0 > 1 is the parameter of the largest Bernstein ellipse of analyticity. Several numerical examples illustrate the theory.
ER -