The discrete plateau problem: algorithm and numerics
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...[Show more]
|Collections||ANU Research Publications|
|Source:||Mathematics of Computation|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.