No label defined (Q3974062)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 17358
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 17358 |
Statements
26 June 1992
0 references
minimal surfaces
0 references
surfaces with prescribed mean curvatures
0 references
prescribed mean curvature
0 references
front-tracking algorithm
0 references
variational algorithm
0 references
interface
0 references
convergence
0 references
numerical experiments
0 references
finite elements
0 references
0.89541453
0 references
0.89264256
0 references
0.88722324
0 references
0.8791088
0 references
0.8746891
0 references
[For the entire collection see Zbl 0722.00035.] The authors describe and compare two different numerical approaches to a prescribed mean curvature problem. The front-tracking algorithm (FTA) minimizes the functional on a polygonal subset of a given open bounded convex set, whereas the variational algorithm (VA) deals with the functional, where the unknown interface does not appear explicitly. Both methods may converge to a relative minimum. The convergence of FTA has not been proved yet, but numerical experiments show a very fast convergence with no oscillation phenomena. The relative minimum is approximated just depending on the initial guess. In VA the functional is first approximated by a family of regular nonconvex functionals, which are then discretized by piecewise linear finite elements. The convergence of both functionals is proved. Some numerical experiments show the behavior of both algorithms. VA is slow, even a relative minimum might disappear; FTA has a number of restrictions as necessary specific data structures.
0 references