Structured higher-order algorithmic differentiation in the forward and reverse mode with application in optimum experimental design

@inproceedings{Walter2012StructuredHA,
  title={Structured higher-order algorithmic differentiation in the forward and reverse mode with application in optimum experimental design},
  author={S. Walter},
  year={2012}
}
  • S. Walter
  • Published 2012
  • Computer Science
  • This thesis provides a framework for the evaluation of first and higher-order derivatives and Taylor series expansions through large computer programs that contain numerical linear algebra (NLA) functions. It is a generalization of traditional algorithmic differentiation (AD) techniques in that NLA functions are regarded as black boxes where the inputs and outputs are related by defining equations. Based on the defining equations, structure-exploiting algorithms are derived. More precisely… CONTINUE READING
    15 Citations
    Differentiation of the Cholesky decomposition
    • I. Murray
    • Mathematics, Computer Science
    • ArXiv
    • 2016
    • 28
    • PDF
    Newton step methods for AD of an objective defined using implicit functions

    References

    SHOWING 1-10 OF 17 REFERENCES
    Matrix Calculus Operations and Taylor Expansions
    • 173
    Differentiation of the Cholesky Algorithm
    • 79
    Smooth Convex Approximation to the Maximum Eigenvalue Function
    • 40
    • PDF
    New elements of analysis on the levi-civita field (computational differentiation)
    • 32
    • Highly Influential
    Numerical detection and reduction of non-uniqueness in nonlinear inverse problems
    • 23
    • PDF
    A matrix handbook for statisticians
    • 377
    • Highly Influential
    Matrix Analysis for Statistics
    • 579