2010
DOI: 10.1007/s10496-010-0236-3
|View full text |Cite
|
Sign up to set email alerts
|

Asymptotic behavior of the Eckhoff method for convergence acceleration of trigonometric interpolation

Abstract: Convergence acceleration of the classical trigonometric interpolation by the Eckhoff method is considered, where the exact values of the "jumps" are approximated by solution of a system of linear equations. The accuracy of the "jump" approximation is explored and the corresponding asymptotic error of interpolation is derived. Numerical results validate theoretical estimates.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3

Citation Types

0
7
0

Year Published

2013
2013
2023
2023

Publication Types

Select...
7

Relationship

1
6

Authors

Journals

citations
Cited by 7 publications
(7 citation statements)
references
References 14 publications
0
7
0
Order By: Relevance
“…Note that the case of a-priori known nodes has been extensively treated in the literature (see e.g. [1,35] for the most recent results). Using the framework of finite difference calculus, one can easily prove the following result (see [8,Theorem 2.8]).…”
mentioning
confidence: 99%
“…Note that the case of a-priori known nodes has been extensively treated in the literature (see e.g. [1,35] for the most recent results). Using the framework of finite difference calculus, one can easily prove the following result (see [8,Theorem 2.8]).…”
mentioning
confidence: 99%
“…Different approaches are known for convergence acceleration of the truncated Fourier series or trigonometric interpolation for non-periodic smooth functions. We refer to [4][5][6][7][8][9][10][11][12][13][14][15][16][17] with references therein for a detailed review of different methods.…”
Section: Introductionmentioning
confidence: 99%
“…Methods of approximating piecewise smooth functions have been introduced by Krylov [54], Lanczos [55] and Eckhoff [25][26][27][28][29]61] in the context of Fourier methods (see also [1,11,12,50,63,64]) and by Lipman and Levin [56] in the context of finite-difference methods. These methods have used a polynomial correction term, written as an expansion in a monomial basis, with coefficients determined from suitable jump conditions.…”
Section: Introductionmentioning
confidence: 99%