Adjoint Code Design Patterns
From MaRDI portal
Publication:4960944
DOI10.1145/3326162zbMATH Open1486.65028OpenAlexW2919526268WikidataQ113309997 ScholiaQ113309997MaRDI QIDQ4960944FDOQ4960944
Authors: Uwe Naumann 
Publication date: 24 April 2020
Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/3326162
Recommendations
- scientific article; zbMATH DE number 1006119
- Programming language features, usage patterns, and the efficiency of generated adjoint code
- Inference of object-oriented design patterns
- scientific article; zbMATH DE number 815103
- scientific article; zbMATH DE number 1082111
- scientific article; zbMATH DE number 2050821
- Unifying dynamic programming design patterns
Numerical quadrature and cubature formulas (65D32) Analysis of algorithms (68W40) Numerical differentiation (65D25)
Cites Work
- Adjoint mode computation of subgradients for McCormick relaxations
- Recipes for adjoint code construction
- Algorithm 799: revolve
- The art of differentiating computer programs. An introduction to algorithmic differentiation.
- OpenAD/F
- Expression templates for primal value taping in the reverse mode of algorithmic differentiation
- Methods of conjugate gradients for solving linear systems
- Triangular Factorization and Inversion by Fast Matrix Multiplication
- On constrained optimization by adjoint based quasi-Newton methods
- Title not available (Why is that?)
- Algorithm 755: ADOL-C
- What Color Is Your Jacobian? Graph Coloring for Computing Derivatives
- Title not available (Why is that?)
- Computational differentiation: techniques, applications, and tools
- On stable piecewise linearization and generalized algorithmic differentiation
- The Tapenade automatic differentiation tool, principles, model, and specification
- Recent advances in algorithmic differentiation. Selected papers based on the presentations at the 6th international conference on automatic differentiation (AD2012), Fort Collins, CO, USA, July 23--27, 2012.
- Title not available (Why is that?)
- Algorithm differentiation of implicit functions and optimal values
- Multistage approaches for optimal offline checkpointing
- Reduced functions, gradients and Hessians from fixed-point iterations for state equations
- Title not available (Why is that?)
- Sensitivity of optimal shapes of artificial grafts with respect to flow parameters
- Title not available (Why is that?)
- Adjoint concepts for the optimal control of Burgers equation
- Fast reverse-mode automatic differentiation using expression templates in C++
- Title not available (Why is that?)
- Algorithmic differentiation of numerical methods: tangent and adjoint solvers for parameterized systems of nonlinear equations
- DAG reversal is NP-complete
- Accumulating Jacobians as chained sparse matrix products
- Collected matrix derivative results for forward and reverse mode algorithmic differentiation
- Optimal accumulation of Jacobian matrices by elimination methods on the dual computational graph
Cited In (10)
- Automated derivation of the adjoint of high-level transient finite element programs
- Adjoints of large simulation codes through automatic differentiation
- Algorithmic differentiation for adjoint sensitivity calculation in plasma edge codes
- Algorithmic differentiation of numerical methods: tangent and adjoint solvers for parameterized systems of nonlinear equations
- ACDP
- Nesting forward-mode AD in a functional framework
- Programming language features, usage patterns, and the efficiency of generated adjoint code
- Development of an adjoint for a complex atmospheric model, the ARPS, using TAF
- SIMPLE adjoint message passing
- Automated adjoints of coupled PDE-ODE systems
Uses Software
This page was built for publication: Adjoint Code Design Patterns
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4960944)
