The discrete Plateau Problem: Algorithm and numerics

  • Dziuk G
  • Hutchinson J
32Citations
Citations of this article
14Readers
Mendeley users who have this article in their library.

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.

Cite

CITATION STYLE

APA

Dziuk, G., & Hutchinson, J. (1999). The discrete Plateau Problem: Algorithm and numerics. Mathematics of Computation, 68(225), 1–23. https://doi.org/10.1090/s0025-5718-99-01025-x

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free