Divided differences of inverse functions and partitions of a convex polygon
From MaRDI portal
Publication:3055071
DOI10.1090/S0025-5718-08-02144-3zbMath1198.05012MaRDI 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
05A18: Partitions of sets
05A17: Combinatorial aspects of partitions of integers
26A24: Differentiation (real functions of one variable): general theory, generalized derivatives, mean value theorems
65D05: Numerical interpolation
41A05: Interpolation in approximation theory
26A06: One-variable calculus
Related Items
A simple algorithm for the fast calculation of higher order derivatives of the inverse function, Divided differences of multivariate implicit functions, A chain rule for multivariate divided differences, A method to accelerate the convergence of the secant algorithm, The antipode of the noncrossing partition lattice, Divided differences of implicit functions
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