The discrete plateau problem: convergence results

Dziuk, Gerhard; Hutchinson, John

Cultural advice

The Australian National University acknowledges, celebrates and pays our respects to the Ngunnawal and Ngambri people of the Canberra region and to all First Nations Australians on whose traditional lands we meet and work, and whose cultures are among the oldest continuing cultures in human history.

Aboriginal and Torres Strait Islander peoples are advised that ANU Library collections may include images, names, voices, and other representations of deceased persons.

Material in the collection may contain terms, language or views that reflect the period in which the item was created and may be considered inappropriate today.

The discrete plateau problem: convergence results

Date

1999

Authors

Dziuk, Gerhard

Hutchinson, John

Publisher

American Mathematical Society

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.

Keywords

Keywords: Finite elements; Minimal surface; Order of convergence; Plateau problem

URI

http://hdl.handle.net/1885/90622

Collections

ANU Research Publications

Source

Mathematics of Computation

Type

Journal article

Full item page

Cultural advice

The discrete plateau problem: convergence results

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

Keywords

Citation

URI

Collections

Source

Type

Book Title

Entity type

Access Statement

License Rights

DOI

Restricted until