The Reconstruction Problem Revisited

Abstract

The role of reconstruction in avoiding oscillations in upwind schemes is reexamined, with the aim of providing simple, concise proofs. In one dimension, it is shown that if the reconstruction is any arbitrary function bounded by neighboring cell averages and increasing within a cell for increasing data, the resulting scheme is monotonicity preserving, even though the reconstructed function may have overshoots and undershoots at the cell edges and is in general not a monotone function. In the special case of linear reconstruction, it is shown that merely bounding the reconstruction between neighboring cell averages is sufficient to obtain a monotonicity preservinc,y scheme. In two dimensions, it is shown that some ID TVD limiters applied in each direction result in schemes that are not positivity preserving, i.e. do not give positive updates when the data are positive. A simple proof is given to show that if the reconstruction inside the cell is bounded by the neighboring cell averages (including corner neighbors), then the scheme is positivity preserving. A new limiter that enforces this condition but is not as dissipative as the Minmod limiter is also presented.