Representation of the Lagrange reconstructing polynomial by combination of substencils
Abstract
The Lagrange reconstructing polynomial [Shu C.W.: SIAM Rev. 51 (2009) 82--126] of a function f(x) on a given set of equidistant (Δx=) points \xi+Δx;\;∈\-M-,...,+M+\\ is defined [Gerolymos G.A.: J. Approx. Theory 163 (2011) 267--305] as the polynomial whose sliding (with x) averages on [x-12Δx,x+12Δx] are equal to the Lagrange interpolating polynomial of f(x) 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) xi+n12Δx (n∈Z), 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 \i-M-,...,i+M+\ as a combination of the Lagrange reconstructing polynomials on the Ks+1≤ M:=M-+M+>1 substencils \i-M-+ks,...,i+M+-Ks+ks\ (ks∈\0,...,Ks\), with weights σR1,M-,M+,Ks,ks(ξ) which are rational functions of ξ (x=xi+ξΔx) [Liu Y.Y., Shu C.W., Zhang M.P.: Acta Math. Appl. Sinica 25 (2009) 503--538], and give an analytical recursive expression of the weight-functions. We then use the analytical expression of the weight-functions σR1,M-,M+,Ks,ks(ξ) to obtain a formal proof of convexity (positivity of the weight-functions) in the neighborhood of ξ=12, under the condition that all of the substencils contain either point i or point i+1 (or both).