A simple algorithm for the fast calculation of higher order derivatives of the inverse function

DOI10.1016/j.amc.2013.06.035zbMath1329.26009OpenAlexW2060940597MaRDI QIDQ905366

Roozbeh Dargazany, Mikhail Itskov, Karl Hörnes

Publication date: 19 January 2016

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2013.06.035

zbMATH Keywords

Taylor expansionhigher order derivativesinverse function

Mathematics Subject Classification ID

Differentiation (real functions of one variable): general theory, generalized derivatives, mean value theorems (26A24)

Related Items (3)

A comprehensive study of the mathematical methods used to approximate the inverse Langevin function ⋮ A generalized approach to generate optimized approximations of the inverse Langevin function ⋮ Generalized error-minimizing, rational inverse Langevin approximations

Cites Work

• Unnamed Item
• Unnamed Item
• Efficient algorithms for doubly and multiply restricted partitions
• Calculating Higher Derivatives of Inverses
• Divided differences of inverse functions and partitions of a convex polygon
• On the nth Derivative of the Inverse Function
• Combinatorics of Higher Derivatives of Inverses
• Taylor expansion of the inverse function with application to the Langevin function

This page was built for publication: A simple algorithm for the fast calculation of higher order derivatives of the inverse function