Skip to content
DraconiticResearch
Search Sources API
203,234 studies31 sourcesUpdated 56 min ago
PreprintarXiv licencearXiv

Efficient Numerical Evaluation of Arbitrary High-order Partial Derivatives via Algebraic Decomposition

  • Shuixin Fang
  • Hang Zeng
Open at sourcePDFDOICite

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.

Related

  1. Pasten's arithmetic derivatives and the decomposition into gains
    R. Laniewski, K. Müller
    arXivPreprintarXiv licenceFull textAlgebra & number theoryarXiv
  2. Efficient r-Adaptive Multipatch Isogeometric Method in Arbitrary Dimension
    Mustapha Bahari, Blaise Faugeras, Bernard Mourrain +1
    HALPreprintCC BY 4.0Full textNumerical analysis & scientific computingHAL
  3. An Efficient Randomized Hierarchical Tucker Decomposition
    Bram Leys, Karl Meerbergen, Nick Vannieuwenhoven +1
    arXivPreprintarXiv licenceFull textNumerical analysis & scientific computingarXiv
  4. Generating functions and efficient numerical simulation of aggregation-fragmentation kinetics
    S. A. Matveev
    arXivPreprintarXiv licenceFull textDynamical systemsStatistical & nonlinear physicsarXiv
  5. Performance Evaluation of an Adaptive Quadrature and a Double Exponential Formula Using Arbitrary-Precision Floating-Point Arithmetic
    Tomonori Kouya
    arXivPreprintCC BY 4.0Full textNumerical analysis & scientific computingarXiv

Cite

BibTeXRIS
BibTeX
@misc{fang2026efficient,
  title = {{Efficient Numerical Evaluation of Arbitrary High-order Partial Derivatives via Algebraic Decomposition}},
  author = {Shuixin Fang and Hang Zeng},
  howpublished = {arXiv},
  year = {2026},
  month = nov,
  doi = {10.48550/arxiv.2611.02948},
  eprint = {2611.02948},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2611.02948},
}
RIS
TY  - UNPB
TI  - Efficient Numerical Evaluation of Arbitrary High-order Partial Derivatives via Algebraic Decomposition
AU  - Shuixin Fang
AU  - Hang Zeng
PY  - 2026
DA  - 2026/11/02
PB  - arXiv
DO  - 10.48550/arxiv.2611.02948
UR  - https://arxiv.org/abs/2611.02948
AB  - 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.
ER  -