Skip navigation
Skip navigation

The discrete plateau problem: algorithm and numerics

Hutchinson, John


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]

CollectionsANU Research Publications
Date published: 1999
Type: Journal article
Source: Mathematics of Computation


There are no files associated with this item.

Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  19 May 2020/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator