Abstract
This article presents a low-storage and low-run-time approach for calculating numerical approximations of adjoint equations for the instationary Navier–Stokes equations with adaptive evaluation of the discretization step. It utilizes adaptive checkpointing. The amounts of memory reduction due to checkpointing and of the increase in run-time caused by repeated forward integration of the Navier–Stokes equations are reported. It is one result that memory reduction of two orders of magnitude only causes a slow down factor of 2–3 in run-time. It is a further result that the adaptive checkpointing for the instationary Navier–Stokes equations causes only a slight increase of the run-time compared to the static optimal checkpointing. The amounts of run-time increase caused by the adaptive checkpoint allocations compared with the static optimal checkpointing are reported as well.
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 callDisclaimer: 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.
