An efficient method for the numerical evaluation of partial derivatives of arbitrary order

DOI10.1145/146847.146924zbMath0892.65011OpenAlexW2060507662WikidataQ113310569 ScholiaQ113310569MaRDI QIDQ4371792

Richard D. Neidinger

Publication date: 9 February 1998

Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)

Full work available at URL: http://www.acm.org/pubs/contents/journals/toms/1992-18/

zbMATH Keywords

algorithmsautomatic differentiationpartial derivativesLeibniz's rulemultivariable functionshyperpyramid data structure

Mathematics Subject Classification ID

Numerical differentiation (65D25)

Related Items (9)

Approximation of solutions of polynomial partial differential equations in two independent variables ⋮ A Taylor series method for the solution of the linear initial-boundary-value problems for partial differential equations ⋮ Directions for computing truncated multivariate Taylor series ⋮ Quadratized Taylor series methods for ODE numerical integration ⋮ Automatic implementation of the numerical Taylor series method: a \textsc{Mathematica} and \textsc{Sage} approach ⋮ Convergence analysis and adaptive strategy for the certified quadrature over a set defined by inequalities ⋮ Higher-order reverse automatic differentiation with emphasis on the third-order ⋮ Evaluating higher derivative tensors by forward propagation of univariate Taylor series ⋮ Implicit extension of Taylor series method with numerical derivatives for initial value problems

This page was built for publication: An efficient method for the numerical evaluation of partial derivatives of arbitrary order