The least-gradient method for computing area minimizing hypersurfaces spanning arbitrary boundaries

DOI10.1016/0377-0427(95)00197-2zbMath0857.65072OpenAlexW2128551332MaRDI QIDQ1919389

Jon T. Pitts, Harold R. Parks

Publication date: 13 October 1996

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-0427(95)00197-2

zbMATH Keywords

minimal surfacehypersurfaceleast-gradient method

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Minimal surfaces and optimization (49Q05) Variational problems in a geometric measure-theoretic setting (49Q20) Methods of reduced gradient type (90C52)

Related Items (4)

The planar least gradient problem in convex domains: the discontinuous case ⋮ Applications of optimal transport methods in the least gradient problem ⋮ Energy estimates for area minimizing hypersurfaces with arbitrary boundaries ⋮ Explicit determination in \(\mathbb{R}^N\) of \((N-1)\)-dimensional area minimizing surfaces with arbitrary boundaries

Uses Software

• Surface Evolver

Cites Work

• Explicit determination of area minimizing hypersurfaces
• Minimal cones and the Bernstein problem
• Concerning my paper on the boundary behavior of minimal surfaces
• A quadratically convergent method for minimizing a sum of euclidean norms
• Explicit determination of area minimizing hypersurfaces. II
• Numerical Approximation of Parametric Oriented Area-Minimizing Hypersurfaces
• The Surface Evolver
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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