The if-problem in automatic differentiation (Q1334756): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0377-0427(94)90294-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2035667607 / rank
 
Normal rank

Revision as of 22:50, 19 March 2024

scientific article
Language Label Description Also known as
English
The if-problem in automatic differentiation
scientific article

    Statements

    The if-problem in automatic differentiation (English)
    0 references
    0 references
    0 references
    22 September 1994
    0 references
    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.
    0 references
    piecewise defined function
    0 references
    bottom-up method
    0 references
    automatic differentiation
    0 references
    if-problem
    0 references
    derivative-consistent representation of a function
    0 references
    0 references

    Identifiers