A simple algorithm for the fast calculation of higher order derivatives of the inverse function
From MaRDI portal
Publication:905366
DOI10.1016/J.AMC.2013.06.035zbMATH Open1329.26009OpenAlexW2060940597MaRDI QIDQ905366FDOQ905366
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
Recommendations
Cites Work
- Title not available (Why is that?)
- Combinatorics of Higher Derivatives of Inverses
- Calculating Higher Derivatives of Inverses
- Efficient algorithms for doubly and multiply restricted partitions
- Divided differences of inverse functions and partitions of a convex polygon
- Title not available (Why is that?)
- On the nth Derivative of the Inverse Function
- Taylor expansion of the inverse function with application to the Langevin function
Cited In (7)
- On the inclination functions and a rapid stable procedure for their evaluation together with derivatives
- A Reflection Principle for Calculating the Derivatives of a Polynomial
- 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
- Calculating Higher Derivatives of Inverses
- Nested derivatives: a simple method for computing series expansions of inverse functions
This page was built for publication: A simple algorithm for the fast calculation of higher order derivatives of the inverse function
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q905366)
