Monotonic unbounded schemes transformer (MUST): an approach to remove undershoots and overshoots in family of unbounded schemes using finite-volume method

Abstract

PurposeThis paper presents a Monotonic Unbounded Schemes Transformer (MUST) approach to bound/monotonize (remove undershoots and overshoots) unbounded spatial differencing schemes automatically, and naturally. Automatically means the approach (1) captures the critical cell Peclet number when an unbounded scheme starts to produce physically unrealistic solution automatically, and (2) removes the undershoots and overshoots as part of the formulation without requiring human interventions. Naturally implies, all the terms in the discretization equation of the unbounded spatial differencing scheme are retained.Design/methodology/approachThe authors do not formulate new higher-order scheme. MUST transforms an unbounded higher-order scheme into a bounded higher-order scheme.FindingsThe solutions obtained with MUST are identical to those without MUST when the cell Peclet number is smaller than the critical cell Peclet number. For cell Peclet numbers larger than the critical cell Peclet numbers, MUST sets the nodal values to the limiter value which can be derived for the problem at-hand. The authors propose a way to derive the limiter value. The authors tested MUST on the central differencing scheme, the second-order upwind differencing scheme and the QUICK differencing scheme. In all cases tested, MUST is able to (1) capture the critical cell Peclet numbers; the exact locations when overshoots and undershoots occur, and (2) limit the nodal value to the value of the limiter values. These are achieved by retaining all the discretization terms of the respective differencing schemes naturally and accomplished automatically as part of the discretization process. The authors demonstrated MUST using one-dimensional problems. Results for a two-dimensional convection–diffusion problem are shown in Appendix to show generality of MUST.Originality/valueThe authors present an original approach to convert any unbounded scheme to bounded scheme while retaining all the terms in the original discretization equation.