2010
DOI: 10.1137/090752456
|View full text |Cite
|
Sign up to set email alerts
|

On the Fourier Extension of Nonperiodic Functions

Abstract: We obtain exponentially accurate Fourier series for non-periodic functions on the interval [−1, 1] by extending these functions to periodic functions on a larger domain. The series may be evaluated, but not constructed, by means of the FFT. A complete convergence theory is given based on orthogonal polynomials that resemble Chebyshev polynomials of the first and second kinds. We analyze a previously proposed numerical method, which is unstable in theory but stable in practice. We propose a new numerical metho… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

4
133
0
1

Year Published

2010
2010
2023
2023

Publication Types

Select...
5
2
2

Relationship

1
8

Authors

Journals

citations
Cited by 123 publications
(138 citation statements)
references
References 31 publications
4
133
0
1
Order By: Relevance
“…Related contributions are due to Gelb, Tadmor, and Tanner [23,43]. A Padé algorithm was proposed in [13], and further contributions in this area include [30] and [41]. For an excellent survey of much of this subject see [43].…”
Section: Examples Of Approximationmentioning
confidence: 99%
“…Related contributions are due to Gelb, Tadmor, and Tanner [23,43]. A Padé algorithm was proposed in [13], and further contributions in this area include [30] and [41]. For an excellent survey of much of this subject see [43].…”
Section: Examples Of Approximationmentioning
confidence: 99%
“…Numerical tests indicate that this approach allows for a quite robust "black-box" construction of linear rational interpolants in the fewest possible nodes. We hope that our results enhance the understanding of the convergence behavior of linear barycentric interpolation and that they make it possible to compare such interpolation schemes with other available methods for interpolation in equispaced nodes, such as the approach proposed in [14] and in the references therein, that in [15], or the schemes reviewed and cited in [18].…”
Section: Resultsmentioning
confidence: 78%
“…, and let R > 0 be the smallest number such that f is analytic in the interior of C R defined in (14). Then the rational interpolants r n defined by (2), with limiting node measure μ and d(n)/n → C, satisfy lim sup In Figure 3 we illustrate the level lines C R for the parameter C = 0.2 with equispaced nodes on the left and with nodes distributed according to the density dμ/ dx = φ(x) = (4 + arctan(4x))/8 on the right.…”
Section: Lemma 3 For Anymentioning
confidence: 99%
“…The orthogonal set of basis functions employed for the pseudospectral optimal control approach is based on half-range Chebyshev Fourier functions [10], defined from trigonometric polynomials called half-range Chebyshev polynomials T k and U k respectively of the first and second kind. Definition 1.…”
Section: Pseudospectral Optimal Controlmentioning
confidence: 99%