Differentiation via logarithmic expansions
From MaRDI portal
Publication:5216802
DOI10.1142/S0217595919500349zbMATH Open1432.90148arXiv1608.07770OpenAlexW2973124012MaRDI QIDQ5216802FDOQ5216802
Authors: Michael C. Fu, Haralambie Leahu, Felisa J. Vázquez-Abad, Bernd Heidergott
Publication date: 20 February 2020
Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)
Abstract: In this note, we introduce a new finite difference approximation called the Black-Box Logarithmic Expansion Numerical Derivative (BLEND) algorithm, which is based on a formal logarithmic expansion of the differentiation operator. BLEND capitalizes on parallelization and provides derivative approximations of arbitrarily precision, i.e., our analysis can be used to determine the number of terms in the series expansion to guarantee a specified number of decimal places of accuracy. Furthermore, in the vector setting, the complexity of the resulting directional derivative is independent of the dimension of the parameter.
Full work available at URL: https://arxiv.org/abs/1608.07770
Recommendations
- Numerical differentiation -- a general purpose algorithm
- An algorithm for the finite difference approximation of derivatives with arbitrary degree and order of accuracy
- scientific article
- On the numerical stability of algorithmic differentiation
- A numerical differentiation library exploiting parallel architectures
sensitivity analysisdirectional derivativenumerical differentiationTaylor series expansionsfinite difference algorithm
Cites Work
This page was built for publication: Differentiation via logarithmic expansions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5216802)