Accurate monotonicity-preserving schemes with Runge-Kutta time stepping (Q1368168)

From MaRDI portal
Revision as of 10:44, 17 July 2025 by CorrectionBot (talk | contribs) (‎Changed label, description and/or aliases in en, and other parts)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)





scientific article; zbMATH DE number 1066703
Language Label Description Also known as
English
Accurate monotonicity-preserving schemes with Runge-Kutta time stepping
scientific article; zbMATH DE number 1066703

    Statements

    Accurate monotonicity-preserving schemes with Runge-Kutta time stepping (English)
    0 references
    0 references
    14 April 1998
    0 references
    The authors introduce a new kind of numerical schemes, designed for both monoticity and accuracy properties. These schemes involve piecewise polynomial solutions, together with an accurate interface formula and Runge-Kutta time stepping. They are presented in details concerning the advection equation with constant speed. In this case, they are proved to be monoticity preserving as well as high-order accurate. Then they are extended to the Euler equations in 1-D and 2-D. Several numerical experiments are provided, in which they compare favorably with ENO and weighted ENO schemes.
    0 references
    monotonicity-preserving schemes
    0 references
    Euler equations
    0 references
    numerical examples
    0 references
    comparison of methods
    0 references
    Runge-Kutta time stepping
    0 references
    weighted ENO schemes
    0 references
    advection equation
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references