On the Properties of Runge-Kutta Discrete Adjoints
From MaRDI portal
Publication:5301485
DOI10.1007/11758549_76zbMATH Open1157.65421OpenAlexW1861060126MaRDI QIDQ5301485FDOQ5301485
Authors: Adrian Sandu
Publication date: 20 January 2009
Published in: Computational Science – ICCS 2006 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11758549_76
Recommendations
- scientific article; zbMATH DE number 5353260
- Runge-Kutta methods in optimal control and the transformed adjoint system
- Discrete adjoint computations for relaxation Runge-Kutta methods
- Symplectic Runge-Kutta schemes for adjoint equations, automatic differentiation, optimal control, and more
- On the discrete adjoints of adaptive time stepping algorithms
Cited In (21)
- Adjoint eigenfunctions of temporally recurrent single-spiral solutions in a simple model of atrial fibrillation
- Generalization of partitioned Runge-Kutta methods for adjoint systems
- AutoMat: automatic differentiation for generalized standard materials on GPUs
- On the properties of discrete adjoints of numerical methods for the advection equation
- Linear multistep methods for optimal control problems and applications to hyperbolic relaxation systems
- Stability and consistency of discrete adjoint implicit peer methods
- On properties of adjoint systems for evolutionary PDEs
- W-methods in optimal control
- Discrete adjoint implicit peer methods in optimal control
- Forward and adjoint sensitivity analysis with continuous explicit Runge-Kutta schemes
- Discrete adjoint computations for relaxation Runge-Kutta methods
- Symplectic Runge-Kutta schemes for adjoint equations, automatic differentiation, optimal control, and more
- On the discrete adjoints of adaptive time stepping algorithms
- Solving parameter estimation problems with discrete adjoint exponential integrators
- Discrete adjoints: theoretical analysis, efficient computation and applications
- Approximation of weak adjoints by reverse automatic differentiation of BDF methods
- Space-time adaptive solution of inverse problems with the discrete adjoint method
- Forward, tangent linear, and adjoint Runge-Kutta methods for stiff chemical kinetic simulations
- Computational Science – ICCS 2005
- An adjoint method for a high-order discretization of deforming domain conservation laws for optimization of flow problems
- A robust, discrete-gradient descent procedure for optimisation with time-dependent PDE and norm constraints
This page was built for publication: On the Properties of Runge-Kutta Discrete Adjoints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5301485)