Efficient Numerical Evaluation of Arbitrary High-order Partial Derivatives via Algebraic Decomposition
Shuixin Fang, Hang Zeng
Abstract
Computing high-order partial derivatives of multivariate functions is often computationally and memory intensive. This paper addresses this problem via an algebraic approach. High-order partial derivatives of a multivariate function are expressed as linear combinations of univariate directional derivatives, which are computationally friendly. The coefficients and direction vectors are determined by the Waring decomposition of monomials, so that the number of univariate directional derivatives in the representation is minimized. Numerical experiments confirm the efficiency of the proposed method.
Create a lesson
Related papers
Convergence analysis of TriCG and TriMR for symmetric quasi-definite linear systems
Kui Du, Jia-Jun Fan
Adaptive data-driven reduced-order models for reciprocal MIMO port-Hamiltonian dynamical systems
Anarzhan Abilgazy, Mikhail Zaslavsky
Fixed-grid schemes for fractional moving-boundary problems
Conrard Giresse Tetsassi Feugmo
Initial-Trace Insufficiency and Entropy-Accounting Separation in Finite-Volume Coarse Graining
Antonis Polemitis, Nicholas Christakis, Dimitris Drikakis
A probabilistic score estimation using the Bismut--Elworthy--Li formula
Jiatong Sun, Long Nguyen, Ning Jiang et al.
Weighted Randomized Kaczmarz for Sparsely Corrupted Linear Systems
Jessie Chen, Ziyu Cheng, Yunhui He et al.