arXiv Analytics

Sign in

arXiv:1911.11722 [math.NA]AbstractReferencesReviewsResources

Recursive multivariate derivatives of $e^{f(x_1,\dots, x_n)}$ of arbitrary order

Filippo M. Miatto

Published 2019-11-26Version 1

High-order derivatives of nested functions of a single variable can be computed with the celebrated Fa\`a di Bruno's formula. Although generalizations of such formula to multiple variables exist, their combinatorial nature generates an explosion of factors, and when the order of the derivatives is high, it becomes very challenging to compute them. A solution is to reuse what has already been computed, which is a built-in feature of recursive implementations. Thanks to this, recursive formulas can play an important role in Machine Learning applications, in particular for Automatic Differentiation. In this manuscript we provide a recursive formula to compute multivariate derivatives of arbitrary order of $e^{f(x_1,\dots,x_n)}$ with respect to the variables $x_i$. We note that this method could also be beneficial in cases where the high-order derivatives of a function $f(x_1,\dots,x_n)$ are hard to compute, but where the derivatives of $\log(f(x_1,\dots,x_n))$ are simpler.

Related articles: Most relevant | Search more
arXiv:1107.0498 [math.NA] (Published 2011-07-03, updated 2012-07-31)
Optimal Contours for High-Order Derivatives
arXiv:1910.04002 [math.NA] (Published 2019-10-09)
Mollified finite element approximants of arbitrary order and smoothness
arXiv:1101.0612 [math.NA] (Published 2011-01-03)
Optimal Meshes for Finite Elements of Arbitrary Order