Skip to content
Research Article Open access CC BY 4.0

Proposition of a Recursive Formula to Calculate the Higher Order Derivative of a Composite Function without Using the Resolution of the Diophantine Equation

EL Khomssi Mohammed, Chaachoui Ghizlane, Ez-Zriouli Rachid

Journal of Advances in Mathematics and Computer Science · pp. 1–7 · Published 11 Feb 2016

10.9734/BJMCS/2016/23535

Abstract

The formula of Fa`a Di Bruno provides a powerful tool to calculate the higher order derivative of a composite function. Unfortunately it has three weaknesses: it is not a recursive formula, it totally depends on the resolution of the diophantine equation and a change in the order of the derivative requires the total change of the calculation. With these weaknesses and the absence of a formula to program, Fa`a Di Bruno’s formula is less useful for formal computation. Other complicated techniques based on finite difference calculation (see [1]) are recursive, however the complexity of the calculation algorithm is very high. There is as well some techniques based on graphs (see [2]) to calculate the coefficients to a certain order, but without giving the general formula. In our work we propose a new formula to calculate the higher order derivative of a composite function gof. It is of great interest, because it is recursive and it is not based on the resolution of the diophantine equation. We complete this work by giving an expression that allows to find directly the n-th derivative of a composite function.

Higher order derivative composite function diophantine equation Faa Di Bruno recurcive formula

Cited by 0

No indexed citations yet.

Article metrics

Real usage data collected on this platform.

0

Page views

0

PDF downloads

0

Outbound clicks

0

Citations

Views by country

Approximate, from request IP at view time — not citizenship or institution. Countries with fewer than 5 views are grouped as "Other".

No views recorded yet.

Traffic sources

Referring site, by host.

No traffic recorded yet.

Views and downloads exclude known bots/crawlers. Citations combines this platform's own DOI-resolved index with each external source's own reported total — see Cited by above for individually listed citing works. Last refreshed 0 seconds ago.