The if-problem in automatic differentiation
Within the last decade it has become apparent that the derivative of an explicitly given function can be computed efficiently by automatic differentiation techniques. These can be classified into two groups: the bottom-up and the top-down methods. The if-problem appears in both modes, so that the authors choose the bottom-up mode. Many computer programs defining a function use statements of the form: if \(B(x)\) then S1 else S2, where \(B(x)\) is a Boolean expression and S1 and S2 denote subprograms. This often leads to a piecewise definition of a function under consideration. In order to obtain correct results the authors make distinction between a function and its representations. In particular, they introduce the notion of derivative-consistent. Automatic differentiation applied to a derivative-consistent representation of a function yields correct results.
- Automatic differentiation of characterizing sequences
- Automatic differentiation of the vector that solves a parametric linear system
- Differentiation in PASCAL-SC: type GRADIENT
- scientific article; zbMATH DE number 3686799 (Why is no real title available?)
- scientific article; zbMATH DE number 140015 (Why is no real title available?)
- scientific article; zbMATH DE number 140039 (Why is no real title available?)
- The Variable Reduction Method for Nonlinear Programming
- scientific article; zbMATH DE number 992812 (Why is no real title available?)
- How to Compute Antiderivatives
- Fitting Matérn smoothness parameters using automatic differentiation
- Automatic differentiation for ML-family languages: correctness via logical relations
- Making assumptions in the automated derivation
This page was built for publication: The if-problem in automatic differentiation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1334756)