Differentiation via logarithmic expansions
From MaRDI portal
Publication:5216802
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.
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; zbMATH DE number 4209439
- On the numerical stability of algorithmic differentiation
- A numerical differentiation library exploiting parallel architectures
Cites work
- scientific article; zbMATH DE number 3203993 (Why is no real title available?)
- Error bounds and comparison results: the Markov reward approach for queueing networks
- Generation of Finite Difference Formulas on Arbitrarily Spaced Grids
- Reversion of Power Series
- Stochastic simulation: Algorithms and analysis
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)