Metraipolis › archive › dc_4aabb89dd464

How well do fast discrete trigonometric transforms work for parametric numerical integration? — arXiv:2609.15577

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.15577
License (as archived)
CC0-1.0
Archived
2026-10-16T01:22:35.207Z
SHA-256 of the archived text
1ad44d7cb6fb6a3a6c71c06ab4aaf51b9527c980f23b36946667f0f5238713e7
Stable URL of this page
https://metraipolis.com/documento/dc_4aabb89dd464

How to cite

How well do fast discrete trigonometric transforms work for parametric numerical integration? — arXiv:2609.15577 — arXiv (en), https://arxiv.org/abs/2609.15577 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_4aabb89dd464 (Metraipolis archive dc_4aabb89dd464, sha256 1ad44d7cb6fb6a3a6c71c06ab4aaf51b9527c980f23b36946667f0f5238713e7)
BibTeX
@misc{dc4aabb89dd464,
  title = {How well do fast discrete trigonometric transforms work for parametric numerical integration? — arXiv:2609.15577},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.15577},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_4aabb89dd464; sha256 1ad44d7cb6fb6a3a6c71c06ab4aaf51b9527c980f23b36946667f0f5238713e7},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.15577. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

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 $\int_0^{\infty} f(x)\cos(2\pi xv)\d x$ and $\int_0^{\infty} f(x)\sin(2\pi xv)\d x$ for $f \in L^1(\Rp) \cap C(\Rp)$ and $v \in \Rp$, as well as the error occurring if the Chebyshev coefficients $\frac{2}{\pi}\int_0^{\pi} h(\cos\theta)\,\cos(n\theta)\d\theta$, $n \in \Np$, of a function $h \in 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 $\operatorname{sech}(\pi\,\cdot)$ the critical geometric rate is attained in both parameters. For Chebyshev approximation of a rational function with simple poles in $\C \setminus I$, the quadrature error has the critical geometric rate $\rho_0^{-P}$ with an explicit constant, where $\rho_0 > 1$ is the parameter of the largest Bernstein ellipse of analyticity. Several numerical examples illustrate the theory.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-15 in math.NA).
Categorie arXiv: Numerical Analysis (math.NA).
Pagina del lavoro: https://arxiv.org/abs/2609.15577 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-16T00:39:06.335Z dalla pagina https://arxiv.org/catchup/math.NA/2026-09-15?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).