Open Access
1995 Numerical solution of soap film dual problems
Kenneth A. Brakke
Experiment. Math. 4(4): 269-287 (1995).


The soap film problem is to minimize area, and its dual is to maximize the flux of a divergenceless bounded vector field. This paper discretizes the continuous problem and solves it numerically. This gives upper and lower bounds on the area of the globally minimizing film. In favorable cases, the method can be used to discover previously unknown films. No initial assumptions about the topology of the film are needed. The paired calibration or covering space model of soap films is used to enable representation of films with singularities.


Download Citation

Kenneth A. Brakke. "Numerical solution of soap film dual problems." Experiment. Math. 4 (4) 269 - 287, 1995.


Published: 1995
First available in Project Euclid: 14 March 2003

zbMATH: 1010.53500
MathSciNet: MR1387693

Primary: 53A10
Secondary: 49Q15 , 65K10

Rights: Copyright © 1995 A K Peters, Ltd.

Vol.4 • No. 4 • 1995
Back to Top