<— Unit 11 — Unit 12: FO — Unit 🍑 —>
Unit 12: Function Operations
Function Operations
+ . - . x . /
More practice
Given x, composite function
Page 36

seen from Russia
seen from United States
seen from Germany
seen from Nigeria

seen from Russia
seen from United States

seen from Australia
seen from Yemen
seen from Australia
seen from Germany
seen from Australia
seen from Malaysia

seen from Philippines

seen from Türkiye

seen from Russia
seen from France
seen from United States

seen from France
seen from United States
seen from Russia
<— Unit 11 — Unit 12: FO — Unit 🍑 —>
Unit 12: Function Operations
Function Operations
+ . - . x . /
More practice
Given x, composite function
Page 36
Inverse Functions
Composite Function
Page 1 / Page 2 / Page 3
*prof note: either prof isn’t bogging us down in implicit shit or the tutor was wrong. Don’t worry about it for this quiz, prof said math checks out
Composite Function
Page 1 / Page 2 / Page 3
Composite Function
Page 1 / Page 2 / Page 3
Proposition of a Recursive Formula to Calculate the Higher Order Derivative of a Composite Function without Using the Resolution of the Diophantine Equation | Chapter 11 | Advances in Mathematics and Computer Science Vol. 4
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.
Author(s) Details
Dr. El Khomssi Mohammed Modelling and Scientific Computing Laboratory, Faculty of Science and Technology of Fez, Box 2202, University S. M. Ben Abdellah Fez, Morocco.
Dr. Chaachoui Ghizlane Modelling and Scientific Computing Laboratory, Faculty of Science and Technology of Fez, Box 2202, University S. M. Ben Abdellah Fez, Morocco.
Dr. Ez-Zriouli Rachid Modelling and Scientific Computing Laboratory, Faculty of Science and Technology of Fez, Box 2202, University S. M. Ben Abdellah Fez, Morocco.
View Volume: http://bp.bookpi.org/index.php/bpi/catalog/book/97