The discrete Plateau Problem: Algorithm and numerics |
| |
Authors: | Gerhard Dziuk John E Hutchinson |
| |
Institution: | Institut für Angewandte Mathematik, Universität Freiburg, Hermann--Herder--Str. 10, D-79104 Freiburg i. Br., GERMANY ; Department of Mathematics, School of Mathematical Sciences, Australian National University, GPO Box 4, Canberra, ACT 0200, AUSTRALIA |
| |
Abstract: | We solve the problem of finding and justifying an optimal fully discrete finite element procedure for approximating minimal, including unstable, surfaces. In this paper we introduce the general framework and some preliminary estimates, develop the algorithm, and give the numerical results. In a subsequent paper we prove the convergence estimate. The algorithmic procedure is to find stationary points for the Dirichlet energy within the class of discrete harmonic maps from the discrete unit disc such that the boundary nodes are constrained to lie on a prescribed boundary curve. An integral normalisation condition is imposed, corresponding to the usual three point condition. Optimal convergence results are demonstrated numerically and theoretically for nondegenerate minimal surfaces, and the necessity for nondegeneracy is shown numerically. |
| |
Keywords: | minimal surface finite elements order of convergence Plateau Problem |
|
| 点击此处可从《Mathematics of Computation》浏览原始摘要信息 |
| 点击此处可从《Mathematics of Computation》下载免费的PDF全文 |
|