English

Approximation error of the Lagrange reconstructing polynomial

Numerical Analysis 2011-01-17 v3 Computational Physics

Abstract

The reconstruction approach [Shu C.W.: {\em SIAM Rev.} {\bf 51} (2009) 82--126] for the numerical approximation of f(x)f'(x) is based on the construction of a dual function h(x)h(x) whose sliding averages over the interval [x12Δx,x+12Δx][x-\tfrac{1}{2}\Delta x,x+\tfrac{1}{2}\Delta x] are equal to f(x)f(x) (assuming an homogeneous grid of cell-size Δx\Delta x). We study the deconvolution problem [Harten A., Engquist B., Osher S., Chakravarthy S.R.: {\em J. Comp. Phys.} {\bf 71} (1987) 231--303] which relates the Taylor polynomials of h(x)h(x) and f(x)f(x), and obtain its explicit solution, by introducing rational numbers τn\tau_n defined by a recurrence relation, or determined by their generating function, gτ(x)g_\tau(x), related with the reconstruction pair of ex{\rm e}^x. We then apply these results to the specific case of Lagrange-interpolation-based polynomial reconstruction, and determine explicitly the approximation error of the Lagrange reconstructing polynomial (whose sliding averages are equal to the Lagrange interpolating polynomial) on an arbitrary stencil defined on a homogeneous grid.

Cite

@article{arxiv.1001.0509,
  title  = {Approximation error of the Lagrange reconstructing polynomial},
  author = {G. A. Gerolymos},
  journal= {arXiv preprint arXiv:1001.0509},
  year   = {2011}
}

Comments

31 pages, 1 table; revised version to appear in J. Approx. Theory

R2 v1 2026-06-21T14:30:40.563Z