2010
DOI: 10.1007/978-3-642-15337-2_10
|View full text |Cite
|
Sign up to set email alerts
|

A Proof, Based on the Euler Sum Acceleration, of the Recovery of an Exponential (Geometric) Rate of Convergence for the Fourier Series of a Function with Gibbs Phenomenon

Abstract: When a function f (x) is singular at a point x s on the real axis, its Fourier series, when truncated at the N-th term, gives a pointwise error of only O(1/N) over the entire real axis. Such singularities spontaneously arise as "fronts" in meteorology and oceanography and "shocks" in other branches of fluid mechanics. It has been previously shown that it is possible to recover an exponential rate of convegence at all points away from the singularity in the sense that |f (x)

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
5
0

Year Published

2013
2013
2021
2021

Publication Types

Select...
7

Relationship

0
7

Authors

Journals

citations
Cited by 7 publications
(5 citation statements)
references
References 42 publications
0
5
0
Order By: Relevance
“…Due to the fact that the proposed method starts exhibiting numerical instability for a relatively low number of basis functions , the true convergence rate cannot be truly recognized form Figure 3. Although that, from observing this figure, we get the impression that the method has an exponential convergence rate, from our previous work with the exponential basis [14] and analysis of convergence rates for series approximations for functions with singularities [42], we expect that the convergence speed is lower and closer to root exponential.…”
Section: Resultsmentioning
confidence: 84%
“…Due to the fact that the proposed method starts exhibiting numerical instability for a relatively low number of basis functions , the true convergence rate cannot be truly recognized form Figure 3. Although that, from observing this figure, we get the impression that the method has an exponential convergence rate, from our previous work with the exponential basis [14] and analysis of convergence rates for series approximations for functions with singularities [42], we expect that the convergence speed is lower and closer to root exponential.…”
Section: Resultsmentioning
confidence: 84%
“…(A.71) is more accurately described as the "Euler acceleration" (or "Abel-Euler summability"[9]) of Eq. (A.70); see also Ref [8]. and those cited therein.…”
mentioning
confidence: 83%
“…It does not add significant computational costs. Unfortunately, the same does not hold for the adaptive filters (Boyd 2011;Tadmor and Tanner 2005;Tanner 2006) because, if we vary coefficients depending on position, we can no longer use the substitution of (2.20) which leads to the COS method.…”
Section: Filtering and The Cos Methodsmentioning
confidence: 99%