Remote Access Mathematics of Computation
Green Open Access

Mathematics of Computation

ISSN 1088-6842(online) ISSN 0025-5718(print)



The discrete plateau problem: Convergence results

Authors: Gerhard Dziuk and John E. Hutchinson
Journal: Math. Comp. 68 (1999), 519-546
MSC (1991): Primary 65N30; Secondary 49Q05, 53A10
MathSciNet review: 1613699
Full-text PDF Free Access

Abstract | References | Similar Articles | Additional Information

Abstract: We solve the problem of finding and justifying an optimal fully discrete finite element procedure for approximating minimal, including unstable, surfaces. In a previous paper we introduced the general framework and some preliminary estimates, developed the algorithm and give the numerical results. In this paper we prove the convergence estimate.

References [Enhancements On Off] (What's this?)

Similar Articles

Retrieve articles in Mathematics of Computation with MSC (1991): 65N30, 49Q05, 53A10

Retrieve articles in all journals with MSC (1991): 65N30, 49Q05, 53A10

Additional Information

Gerhard Dziuk
Affiliation: Institut für Angewandte Mathematik, Universität Freiburg, Hermann–Herder–Str. 10, D-79104 Freiburg i. Br., GERMANY

John E. Hutchinson
Affiliation: Department of Mathematics, School of Mathematical Sciences, Australian National University, GPO Box 4, Canberra, ACT 0200, AUSTRALIA
MR Author ID: 90330

Keywords: Minimal surface, finite elements, order of convergence, Plateau Problem
Received by editor(s): August 26, 1996
Article copyright: © Copyright 1999 American Mathematical Society