Divided differences of inverse functions and partitions of a convex polygon
From MaRDI portal
Publication:3055071
DOI10.1090/S0025-5718-08-02144-3zbMath1198.05012OpenAlexW2053290854MaRDI QIDQ3055071
Publication date: 7 November 2010
Published in: Mathematics of Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1090/s0025-5718-08-02144-3
Partitions of sets (05A18) Combinatorial aspects of partitions of integers (05A17) Differentiation (real functions of one variable): general theory, generalized derivatives, mean value theorems (26A24) Numerical interpolation (65D05) Interpolation in approximation theory (41A05) One-variable calculus (26A06)
Related Items (6)
A simple algorithm for the fast calculation of higher order derivatives of the inverse function ⋮ A chain rule for multivariate divided differences ⋮ Divided differences of multivariate implicit functions ⋮ A method to accelerate the convergence of the secant algorithm ⋮ Divided differences of implicit functions ⋮ The antipode of the noncrossing partition lattice
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Ordered trees and non-crossing partitions
- Polygon dissections and Euler, Fuss, Kirkman, and Cayley numbers
- Noncrossing partitions
- Sur les partitions non croisées d'un cycle. (The non-crossed partitions of a cycle)
- Two chain rules for divided differences and Faà di Bruno’s formula
- The Curious History of Faa di Bruno's Formula
- Combinatorics of Higher Derivatives of Inverses
- Symbolic computation of divided differences
This page was built for publication: Divided differences of inverse functions and partitions of a convex polygon