Minimal Repetition Dynamic Checkpointing Algorithm for Unsteady Adjoint Calculation
From MaRDI portal
adjoint equationautomatic differentiationcheckpointing schemedynamic checkpointingonline checkpointingoptimal checkpointingrevolve
Lua error in Module:PublicationMSCList at line 28: attempt to call field 'getDbData' (a nil value).
Lua error in Module:PublicationShowAbstract at line 21: attempt to call field 'getDbData' (a nil value).
Recommendations
- scientific article; zbMATH DE number 2110758
- Periodicity in optimal hierarchical checkpointing schemes for adjoint computations
- Reduction of storage requirement by checkpointing for time-dependent optimal control problems in ODEs
- Checkpointing schemes for adjoint codes: Application to the meteorological model Meso-NH
- An optimal time-stepping algorithm for unsteady advection-diffusion problems
- Stabilisation of discrete steady adjoint solvers
- Optimal multistage algorithm for adjoint computation
- Adaptive time-stepping and computational stability
Cited in
(48)- On the efficiency of gradient based optimization algorithms for DNS-based optimal control in a turbulent channel flow
- A GPU accelerated adjoint-based optimizer for inverse modeling of the two-dimensional shallow water equations
- Towards efficient backward-in-time adjoint computations using data compression techniques
- Topology optimization of viscoelastic structures using a time-dependent adjoint method
- Towards adjoint-based mesh refinement for large eddy simulation using reduced-order primal solutions: preliminary 1D Burgers study
- A stochastic subspace approach to gradient-free optimization in high dimensions
- On-the-fly dual reduction for time-dependent topology optimization
- The unsteady continuous adjoint method for minimizing flow-induced sound radiation
- Lossy compression techniques supporting unsteady adjoint on 2D/3D unstructured grids
- Forward and adjoint sensitivity computation of chaotic dynamical systems
- Discrete adjoint sensitivity analysis for fluid flow topology optimization based on the generalized lattice Boltzmann method
- Superconvergent functional output for time-dependent problems using finite differences on summation-by-parts form
- Reducing memory requirements in scientific computing and optimal control
- Optimal multistage algorithm for adjoint computation
- Structure exploiting adjoints for finite element discretizations
- A-revolve: an adaptive memory-reduced procedure for calculating adjoints; with an application to computing adjoints of the instationary Navier–Stokes system
- Continuous adjoint methods for turbulent flows, applied to shape and topology optimization: industrial applications
- The instanton method and its numerical implementation in fluid mechanics
- Space-time adaptive solution of inverse problems with the discrete adjoint method
- Computational strategies for reliability-based structural optimization of aeroelastic limit cycle oscillations
- Partitioned solution of an unsteady adjoint for strongly coupled fluid-structure interactions and application to parameter identification of a one-dimensional problem
- Sensitivity analysis of limit cycle oscillations
- Randomized sketching algorithms for low-memory dynamic optimization
- \texttt{PETSc TSAdjoint}: a discrete adjoint ODE solver for first-order and second-order sensitivity analysis
- Layer-Parallel Training of Deep Residual Neural Networks
- A two-step back–forth algorithm for the solution of the unsteady adjoint equations
- The drag-adjoint field of a circular cylinder wake at Reynolds numbers 20, 100 and 500
- Automated calculation of higher order partial differential equation constrained derivative information
- Small-scale reconstruction in three-dimensional Kolmogorov flows using four-dimensional variational data assimilation
- Periodicity in optimal hierarchical checkpointing schemes for adjoint computations
- An incremental singular value decomposition approach for large-scale spatially parallel \& distributed but temporally serial data -- applied to technical flows
- A matrix-free exact Newton method
- Generalized shape optimization of transient vibroacoustic problems using cut elements
- Reducing time and memory requirements in topology optimization of transient problems
- Efficient N-to-M checkpointing algorithm for finite element simulations
- Large-eddy simulation-based shape optimization for mitigating turbulent wakes of a bluff body using the regularized ensemble Kalman method
- TorchBraid: high-performance layer-parallel training of deep neural networks with MPI and GPU acceleration
- A perspective on the state of aerospace computational fluid dynamics technology
- Topology optimization of systems experiencing hydrodynamic responses
- Information geometric regularization for computing sensitivities of flows with shocks
- GRADSOLVE: fast exact gradients for ODE ensembles on GPUs
- A randomized sketching trust-region secant method for low-memory dynamic optimization
- A fast algorithm for parabolic PDE-based inverse problems based on Laplace transforms and flexible Krylov solvers
- Topology optimization of unsteady flow problems using the lattice Boltzmann method
- \texttt{Ozone}: an open-source ordinary differential equation solver for gradient-based optimization
- Memory-efficient nonsmooth dynamic optimization using adaptive randomized compression
- Modeling periodic and non-periodic response of dynamical systems using an efficient Chebyshev-based time-spectral approach
- A Monte Carlo method for solving unsteady adjoint equations
This page was built for publication: Minimal Repetition Dynamic Checkpointing Algorithm for Unsteady Adjoint Calculation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3581056)
