𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Rate of convergence of the mean curvature flow

✍ Scribed by Natasa Sesum


Publisher
John Wiley and Sons
Year
2008
Tongue
English
Weight
171 KB
Volume
61
Category
Article
ISSN
0010-3640

No coin nor oath required. For personal study only.

✦ Synopsis


Abstract

We study the flow M~t~ of a smooth, strictly convex hypersurface by its mean curvature in ℝ^n + 1^. The surface remains smooth and convex, shrinking monotonically until it disappears at a critical time T and point x^*^ (which is due to Huisken). This is equivalent to saying that the corresponding rescaled mean curvature flow converges to a sphere S^n^ of radius √n. In this paper we will study the rate of exponential convergence of a rescaled flow. We will present here a method that tells us that the rate of the exponential decay is at least 2/n. We can define the β€œarrival time” u of a smooth, strictly convex, n‐dimensional hypersurface as it moves with normal velocity equal to its mean curvature via u(x) = t if x ∈ M~t~ for x ∈ Int(M~0~). Huisken proved that, for n β‰₯ 2, u(x) is C^2^ near x^*^. The case n = 1 has been treated by Kohn and Serfaty [11]; they proved C^3^‐regularity of u. As a consequence of the obtained rate of convergence of the mean curvature flow, we prove that u is not necessarily C^3^ near x^*^ for n β‰₯ 2. We also show that the obtained rate of convergence 2/n, which arises from linearizing a mean curvature flow, is the optimal one, at least for n β‰₯ 2. Β© 2007 Wiley Periodicals, Inc.


πŸ“œ SIMILAR VOLUMES


Mean curvature flows and isotopy of maps
✍ Mao-Pei Tsui; Mu-Tao Wang πŸ“‚ Article πŸ“… 2004 πŸ› John Wiley and Sons 🌐 English βš– 149 KB

## Abstract Let __f__ be a smooth map between unit spheres of possibly different dimensions. We prove the global existence and convergence of the mean curvature flow of the graph of __f__ under various conditions. A corollary is that any area‐decreasing map between unit spheres (of possibly differe

Convergence Complexity of Optimistic Rat
✍ Yehuda Afek; Yishay Mansour; Zvi Ostfeld πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 235 KB

This paper studies basic properties of rate-based flow-control algorithms and of the max-min fairness criteria. For the algorithms we suggest a new approach for their modeling and analysis, which may be considered more ''optimistic'' and realistic than traditional approaches. Three variations of the