Abstract

Unsteady flow computations typically rely on time integration schemes which employ the same step size everywhere. However, in cases with strong variations of wave speed and/or spatial resolution, local stability criteria and truncation errors would allow for much larger time steps in parts of the domain. To exploit this potential of improving the computational efficiency, adaptive time-stepping methods have been developed. Recently, an adaptive conservative time integration (ACTI) scheme for explicit finite volume methods was devised. Opposed to previous methods, ACTI guarantees exact conservation and periodic synchronization. Both are achieved by splitting a global time step into 2L (L≥0 is a cell dependent level) sub-steps, whereas the order of cell updates is critical. It has been demonstrated for flows in fractured porous media and for the Euler equations that ACTI can reduce the computational cost dramatically while preserving second order accuracy in space and time. In this paper, the ACTI scheme is extended to the compressible Navier-Stokes-Fourier system, and special attention is required for the spatio-temporal discretization of the convective and viscous fluxes. Numerical studies of unsteady flows involving shock boundary layer interaction demonstrate that the same accuracy is achieved with the new compressible ACTI flow solver as with classical time integration, but at much lower cost. Moreover, since the method is explicit, it has the potential for efficient computations on multiple CPUs and GPUs.

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.