Abstract
AbstractThis paper discusses approximation schemes for adjoints in control of the instationary Navier–Stokes system. It tackles the storage problem arising in the numerical calculation of the appearing adjoint equations by proposing a low‐storage approach which utilizes optimal checkpointing. For this purpose, a new proof of optimality is given. This new approach gives so far unknown properties of the optimal checkpointing strategies and thus provides new insights. The optimal checkpointing allows a remarkable memory reduction by accepting a slight increase in run‐time caused by repeated forward integrations as illustrated by means of the Navier–Stokes equations. In particular, a memory reduction of two orders of magnitude causes only a slow down factor of 2–3 in run‐time. Copyright © 2005 John Wiley & Sons, Ltd.
Sign-in/Register to access full text options 
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.
