Representation of the Lagrange reconstructing polynomial by combination of substencils
arXiv:1102.3136 · doi:10.1016/j.cam.2012.01.008
Abstract
The Lagrange reconstructing polynomial [Shu C.W.: {\em SIAM Rev.} {\bf 51} (2009) 82--126] of a function on a given set of equidistant ($Δx=\const$) points is defined [Gerolymos G.A.: {\em J. Approx. Theory} {\bf 163} (2011) 267--305] as the polynomial whose sliding (with ) averages on are equal to the Lagrange interpolating polynomial of on the same stencil. We first study the fundamental functions of Lagrange reconstruction, show that these polynomials have only real and distinct roots, which are never located at the cell-interfaces (half-points) (), and obtain several identities. Using these identities, by analogy to the recursive Neville-Aitken-like algorithm applied to the Lagrange interpolating polynomial, we show that there exists a unique representation of the Lagrange reconstructing polynomial on as a combination of the Lagrange reconstructing polynomials on the substencils (), with weights which are rational functions of () [Liu Y.Y., Shu C.W., Zhang M.P.: {\em Acta Math. Appl. Sinica} {\bf 25} (2009) 503--538], and give an analytical recursive expression of the weight-functions. We then use the analytical expression of the weight-functions to obtain a formal proof of convexity (positivity of the weight-functions) in the neighborhood of , under the condition that all of the substencils contain either point or point (or both).
final corrected version; in print J. Comp. Appl. Math