Multistage approaches for optimal offline checkpointing
DOI10.1137/080718036zbMATH Open1194.65084OpenAlexW2084820956MaRDI QIDQ3567013FDOQ3567013
Authors: Philipp Stumm, Andrea Walther 
Publication date: 10 June 2010
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/080718036
Recommendations
- New algorithms for optimal online checkpointing
- Checkpointing schemes for adjoint codes: Application to the meteorological model Meso-NH
- scientific article; zbMATH DE number 2110758
- Reduction of storage requirement by checkpointing for time-dependent optimal control problems in ODEs
- A memory-reduced implementation of the Newton-CG method in optimal control of nonlinear time-dependent PDEs
Numerical optimization and variational techniques (65K10) Complexity and performance of numerical algorithms (65Y20) Analysis of algorithms (68W40) Existence theories for optimal control problems involving partial differential equations (49J20) Applications of optimal control and differential games (49N90)
Cited In (19)
- Reducing memory requirements in scientific computing and optimal control
- Parallel reverse time integration and reduced order models
- Periodicity in optimal hierarchical checkpointing schemes for adjoint computations
- The Data-Flow Equations of Checkpointing in Reverse Automatic Differentiation
- New algorithms for optimal online checkpointing
- Reduction of storage requirement by checkpointing for time-dependent optimal control problems in ODEs
- \texttt{PETSc TSAdjoint}: a discrete adjoint ODE solver for first-order and second-order sensitivity analysis
- Structure exploiting adjoints for finite element discretizations
- Memory efficient approaches of second order for optimal control problems.
- Memory-efficient implementation of Riccati approach for time-dependent optimal control problems in ODEs
- On evaluating higher-order derivatives of the QR decomposition of tall matrices with full column rank in forward and reverse mode algorithmic differentiation
- Adjoint Code Design Patterns
- Optimal multistage algorithm for adjoint computation
- Title not available (Why is that?)
- Automated calculation of higher order partial differential equation constrained derivative information
- A matrix-free exact Newton method
- Approximately uniform online checkpointing with bounded memory
- Reducing memory requirements of unsteady adjoint by synergistically using check-pointing and compression
- Storing versus recomputation on multiple DAGs
Uses Software
This page was built for publication: Multistage approaches for optimal offline checkpointing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3567013)
