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

preprint2010arXivOpen access

Abstract

When a function f(x)f(x) is singular at a point xsx_{s} on the real axis, its Fourier series, when truncated at the NN-th term, gives a pointwise error of only O(1/N)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)−fNσ(x)∣∼O(exp⁡(−q(x)N))|f(x) - f_{N}^σ(x) | \sim O(\exp(- q(x) N)) where fNσ(x)f_{N}^σ(x) is the result of applying a filter or summability method to the partial sum fN(x)f_{N}(x) and q(x)q(x) is a proportionality constant that is a function of d(x)≡∣x−xs∣d(x) \equiv |x-x_{s}|, the distance from xx to the singularity. Here we give an elementary proof of great generality using conformal mapping in a dummy variable zz; this is equivalent to applying the Euler acceleration. We show that q(x)≈log⁡(cos⁡(d(x)/2))q(x) \approx \log(\cos(d(x)/2)) for the Euler filter when the Fourier period is 2π2 π. More sophisticated filters can increase q(x)q(x), but the Euler filter is simplest. We can also correct recently published claims that only a root-exponential rate of convergence can be recovered for filters of compact support such as the Euler acceleration and the Erfc-Log filter.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.