Computational and Analytical Study of Variations and Generalizations of the FC-Gram Approximation Algorithm
Fuente:
arXiv
Salvato in:
| Autori principali: | , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2026
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866913094533382144 |
|---|---|
| author | Nainwal, Prakash Anand, Akash |
| author_facet | Nainwal, Prakash Anand, Akash |
| contents | The FC-Gram algorithm approximates non-periodic functions to high order by constructing a periodic extension with controlled boundary behavior and applying trigonometric interpolation. In this paper we introduce a generalized FC-Gram framework (GenFC), which provides greater flexibility in the construction of the blending continuation of Gram polynomials. This flexibility gives better control over the shape of the periodic extension and leads to improved approximation accuracy. We establish a convergence theorem showing that the trigonometric interpolant converges at the rate $\mathcal{O}(n^{-\min(r+β,\,d)})$ in the supremum norm on the original interval, where $r$ is the smoothness of the target function, $d$ the number of Gram polynomials, and $β\in [0,1]$ a Fourier-decay parameter. The framework and its analysis are developed so that the modified FC-Gram method of [J. Sci. Comput., 105(1):8, 2025] is recovered as a particular case. Numerical experiments confirm the predicted convergence rates and show that the added flexibility of the GenFC framework leads to improved approximation accuracy, with the gains carrying over to a Fourier continuation solver for two-point boundary value problems. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2605_04765 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Computational and Analytical Study of Variations and Generalizations of the FC-Gram Approximation Algorithm Nainwal, Prakash Anand, Akash Numerical Analysis 65D15, 65T40, 65L10 The FC-Gram algorithm approximates non-periodic functions to high order by constructing a periodic extension with controlled boundary behavior and applying trigonometric interpolation. In this paper we introduce a generalized FC-Gram framework (GenFC), which provides greater flexibility in the construction of the blending continuation of Gram polynomials. This flexibility gives better control over the shape of the periodic extension and leads to improved approximation accuracy. We establish a convergence theorem showing that the trigonometric interpolant converges at the rate $\mathcal{O}(n^{-\min(r+β,\,d)})$ in the supremum norm on the original interval, where $r$ is the smoothness of the target function, $d$ the number of Gram polynomials, and $β\in [0,1]$ a Fourier-decay parameter. The framework and its analysis are developed so that the modified FC-Gram method of [J. Sci. Comput., 105(1):8, 2025] is recovered as a particular case. Numerical experiments confirm the predicted convergence rates and show that the added flexibility of the GenFC framework leads to improved approximation accuracy, with the gains carrying over to a Fourier continuation solver for two-point boundary value problems. |
| title | Computational and Analytical Study of Variations and Generalizations of the FC-Gram Approximation Algorithm |
| topic | Numerical Analysis 65D15, 65T40, 65L10 |
| url | https://arxiv.org/abs/2605.04765 |