The least gradient method for computing area-minimizing hypersurfaces

From MaRDI portal





By the method of least gradient, area minimizing hypersurfaces are obtained as level sets of functions \(u\) minimizing the integral \(\int |Du |\) on a domain \(\Omega \subset \mathbb{R}^n\) with fixed boundary values. In the present article, the author sketches the main ideas and principal results of this approach. Special emphasis is given on the approximation of minimal surfaces by level sets of functions which are almost of least gradient integral. Moreover, some classical examples in minimal surface theory are discussed within the level set approach, among them the famous catenoid-disc bifurcation in the family of minimizing surfaces spanning two circles in parallel planes which are moved apart. For the entire collection see [Zbl 0778.00020].











This page was built for publication: The least gradient method for computing area-minimizing hypersurfaces

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3140612)