BibTeX
@INCOLLECTION{
Faure1996SoA,
author = "Christ{\`e}le Faure",
editor = "Martin Berz and Christian Bischof and George Corliss and Andreas Griewank",
title = "Splitting of Algebraic Expressions for Automatic Differentiation",
booktitle = "Computational Differentiation: Techniques, Applications, and Tools",
pages = "117127",
publisher = "SIAM",
address = "Philadelphia, PA",
key = "Faure1996SoA",
crossref = "Berz1996CDT",
abstract = "The number of products needed for the computation of a function and its first
derivative is less than three times the number of essential products needed for the computation of
the function itself, if each expression is split into binary subexpressions. We have implemented a
split facility in Odyss\'ee to fit this theoretical idea. Odyss\'ee takes a set
of subroutines as input and generates a new set of subroutines that compute the derivatives in
forward or reverse mode. In practice, the decrease of the number of products does not lead to a
decrease of run time, because current compilers do some sharing equivalent to a partial split and
mismanage memory related to split variab",
keywords = "Complexity, split, algebraic expressions, Odyss\'ee",
referred = "[Giles2002OtI].",
year = "1996"
}
