An algorithm for evolutionary surfaces (Q751220): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q384176
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / author
 
Property / author: Gerhard Dziuk / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Motion of a Surface by Its Mean Curvature. (MN-20) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flow by mean curvature of convex surfaces into spheres / rank
 
Normal rank

Latest revision as of 11:47, 21 June 2024

scientific article
Language Label Description Also known as
English
An algorithm for evolutionary surfaces
scientific article

    Statements

    An algorithm for evolutionary surfaces (English)
    0 references
    1991
    0 references
    Using the finite element method in space coordinates and then an implicit time discretization in time t, the author presents a numerical algorithm to evaluate the mean curvature flow of surfaces with or without boundary which are described in time by the equation \(\partial u/\partial t- \Delta_{S(t)}u=2 H(u)n,\quad u(,0)=u_ 0,\) where \(\Delta_{S(t)}\) is the Beltrami operator on S(t), H being the mean curvature of S(t). As a limit case as \(t\to \infty\), this method can give a solution to Plateau's problem for H-surfaces. Some numerical results and their graphic pictures are also presented.
    0 references
    algorithm
    0 references
    evolutionary surfaces
    0 references
    finite element method
    0 references
    implicit time discretization
    0 references
    mean curvature flow of surfaces
    0 references
    Beltrami operator
    0 references
    Plateau's problem
    0 references
    H-surfaces
    0 references
    numerical results
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references