An optimal memory-reduced procedure for calculating adjoints of the instationary Navier-Stokes equations

Optimal Control Applications and Methods

Volumn 27, Issue 1, 2006, Pages 19-40

  Hinze, Michael ^a   Walther, Andrea ^a   Sternberg, Julia ^a  

^a DRESDEN UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

Adjoints; Binomial checkpointing; Instationary Navier Stokes equations

Indexed keywords

APPROXIMATION THEORY; COMPUTER CIRCUITS; COMPUTER SIMULATION; INTEGRATION; NAVIER STOKES EQUATIONS;

ADJOINTS; BINOMIAL CHECKPOINTING; INSTATIONARY NAVIER-STOKES EQUATIONS;

DATA STORAGE EQUIPMENT;

EID: 32344441382     PISSN: 01432087     EISSN: None     Source Type: Journal    
DOI: 10.1002/oca.771     Document Type: Review

References (24)

1. Griewank A, Walther A. Revolve: an implementation of checkpointing for the reverse or adjoint mode of computational differentiation. ACM Transactions on Mathematical Software 2000; 26:19-45.
2. Sternberg J. Adaptive Umkehrschemata für Schrittfolgen mit nicht-uniformen Kosten. Diploma Thesis, Institute of Scientific Computing, TU Dresden, 2002.
3. Berggren M. Numerical solution of a flow control problem: vorticity reduction by dynamic boundary action. SIAM Journal on Scientific and Computing 1998; 19(3):829-860.
4. Berggren M, Glowinski R, Lions JL. A computational approach to controllability issues for flow-related models. I: pointwise control of the viscous Burgers equation. International Journal of Computational Fluid Dynamics 1996; 7(3):237-252.
5. Walther A, Griewank A. Advantages of binomial checkpointing for memory-reduced adjoint calculations. In Numerical Mathematics and Advanced Applications, Feistauer M et al. (eds). Proceedings of ENUMATH 2003. Springer: Berlin, 2004; 834-843.
6. Walther A, Griewank A. Applying the checkpointing routine treeverse to discretizations of burgers' equation. In High Performance Scientific and Engineering Computing, Bungartz H-J, Durst F, Zenger C (eds), Lecture Notes in Computational Science and Engineering, vol. 8. Springer: Berlin, 1999; 13-24.
7. Hinze M, Sternberg J. A-revolve: an adaptive memory and run-time-reduced procedure for calculating adjoints; with an application to the instationary Navier-Stokes system. Optimization Methods and Software 2005; 20(6):645-663.
8. Hinze M, Kunisch K. Second order methods for optimal control of time-dependent fluid flow. SIAM Journal on Control and Optimization 2001; 40:925-946.
9. Gunzburger MD, Manservisi S. Analysis and approximation of the velocity tracking problem for Navier-Stokes flows with distributed control. SIAM Journal on Numerical Analysis 2000; 37:1481-1512.
10. Hinze M. Optimal and instantaneous control of the instationary Navier-Stokes equations. Habilitationsschrift, 1999. Fachbereich Mathematik, Technische Universität Berlin, 1999.
11. Temam R. Navier-Stokes Equations. North-Holland: Amsterdam, 1979.
12. Abergel F, Temam R. On some control problems in fluid mechanics. Theoretical and Computational Fluid Dynamics 1990; 1:303-325.
13. Constantin P, Foias C. Navier-Stokes Equations. The University of Chicago Press: Chicago, 1988.
14. Deckelnick K, Hinze M. Error estimates in space and time for tracking-type control of the instationary Stokes system. International Series on Numerical Mathematics 2002; 143:87-103.
15. Heywood JG, Rannacher R. Finite-element approximation of the nonstationary Navier-Stokes problem, I-IV. SIAM Journal on Numerical Analysis 1982-1990; 19:275-311.
16. Heywood JG, Rannacher R. Finite-element approximation of the nonstationary Navier-Stokes problem, I-IV. SIAM Journal on Numerical Analysis 1982-1990; 23:750-777
17. Heywood JG, Rannacher R. Finite-element approximation of the nonstationary Navier-Stokes problem, I-IV. SIAM Journal on Numerical Analysis 1982-1990; 25:489-512
18. Heywood JG, Rannacher R. Finite-element approximation of the nonstationary Navier-Stokes problem, I-IV. SIAM Journal on Numerical Analysis 1982-1990; 27:353-384.
19. Kaltenbach HJ, Jürgens W, Spille A. Numerische Simulation, Beeinflussung und Eigenmoden-Analyse einer abgelösten Strömung mit Querkomponente. In Ergebnisberichte SFB 557 TP A6, 2001.
20. Grimm J, Pottier L, Rostaing-Schmidt N. Optimal time and minimum space-time product for reversing a certain class of programs. In Computational Differentiation: Techniques, Applications, and Tools, Berz M, Bischof C, Corliss G, Griewank A (eds), SIAM: Philadelphia, PA, 1996; 95-106.
21. Heimbach P, Hill C, Giering R. An efficient exact adjoint of the parallel mit general circulation model, generated via automatic differentiation. Future Generation Computer Systems 2005; 21(8):1356-1371.
22. Griewank A. Achieving logarithmic growth of temporal and spatial complexity in reverse automatic differentiation. Optimization Methods and Software 1992; 1(1):35-54.
23. Griewank A. Evaluating Derivatives: Principles and Techniques of Algorithmic Differentiation. Frontiers in Applied Mathematics, Number 19. SIAM: Philadelphia, PA, 2000.
24. Walther A. Program reversal schedules for single- and multi-processor machines. Ph.D. Thesis, Institute of Scientific Computing, TU Dresden, 1999.