Abstract

Implicit/Explicit (IMEX) Runge-Kutta (RK) schemes are effective for time-marching ODE systems with both stiff and nonstiff terms on the RHS; such schemes implement an (often A-stable or better) implicit RK scheme for the stiff part of the ODE, which is often linear, and, simultaneously, a (more convenient) explicit RK scheme for the nonstiff part of the ODE, which is often nonlinear. Low-storage RK schemes are especially effective for time-marching high-dimensional ODE discretizations of PDE systems on modern (cache-based) computational hardware, in which memory management is often the most significant computational bottleneck. In this paper, we develop one second-order, three thirdorder and one fourth-order IMEXRK schemes of the low-storage variety, all of which have the same or comparable low storage requirements, better stability properties, and either fewer or slightly more floating-point operations per timestep as the venerable (and, up to now, unique) second-order tworegister Crank-Nicolson/Runge-Kutta-Wray (CN/RKW3) IMEXRK algorithm that has dominated the DNS/LES literature for the last two decades.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.