Structure exploiting adjoints for finite element discretizations
From MaRDI portal
Recommendations
- Structure-exploiting automatic differentiation of finite element discretizations
- Towards Matrix-Free AD-Based Preconditioning of KKT Systems in PDE-Constrained Optimization
- Periodicity in optimal hierarchical checkpointing schemes for adjoint computations
- scientific article; zbMATH DE number 749950
- Discrete adjoints: theoretical analysis, efficient computation and applications
Cites work
- Algorithm 799: revolve
- Automatic differentiation of explicit Runge-Kutta methods for optimal control
- Formulation of a Galerkin spectral element--Fourier method for three-dimensional incompressible flows in cylindrical geometries
- Minimal Repetition Dynamic Checkpointing Algorithm for Unsteady Adjoint Calculation
- Multistage approaches for optimal offline checkpointing
- New algorithms for optimal online checkpointing
Cited in
(3)
This page was built for publication: Structure exploiting adjoints for finite element discretizations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2961061)