On iterative convexity of diffeomorphism
2018
AbstractA function f is said to be iteratively convex if f possesses convex iterative roots of all orders. We give several constructions of iteratively convex diffeomorphisms and explain the phenomenon that the non-existence of convex iterative roots is a typical property of convex functions. We show also that a slight perturbation of iteratively convex functions causes loss of iterative convexity. However, every convex function can be approximate by iteratively convex functions.
Keywords:
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
9
References
0
Citations
NaN
KQI