On the selection of maximal Cheeger sets
Overview & Synopsis
Given a bounded open subset Ω of ℝd and two positive weight functions ƒ et g, the Cheeger sets of Ω are the subdomains C of finite perimeter of Ω that maximize the ratio ∫cƒ(x)dx/∫∂*c g(x)dΗd-1. Existence of Cheeger sets is a well-known fact. Uniqueness is a more delicate issue and is not true in general (although it holds when Ω is convex and ƒ ≡ g ≡ 1 as recently proved in [4]). However, there always exists a unique maximal (in the sense of inclusion) Cheeger set and this paper addresses the issue of how to determine this maximal set. We show that in general the approximation by the p-Laplacian does not provide, as p → 1, a selection criterion for determining the maximal Cheeger set. On the contrary, a different perturbation scheme, based on the constrained maximization of ∫Ω ƒ(u-εΦ(u))dx for a strictly convex function Φ, gives, as ε→0, the desired maximal set.
hal.science)
← / → for pages • + / - for zoom • 0 to fit width
Powered by Mozilla PDF.js v3.11
Document Information
| Document Title | On the selection of maximal Cheeger sets |
|---|---|
| Author / Organization | Giuseppe Buttazzo, Guillaume Carlier, Myriam Comte |
| Subject & Discipline | Multidisciplinary Academic Open Research |
| Categories | Science & Mathematics |
| Publication Year | 2007 |
| License / Rights | Open Access / Creative Commons |
| Resource Verification | Listed PDF (Verification Pending) |
| Original Host Website |
HAL Open Science
(hal.science)
|
| File Format | application/pdf (Portable Document Format) |
| Language | EN |
| Catalog ID | DOC-257655 |
| Original Source Link | Visit Source Page on hal.science » |