.png){kind=icon}
Return
Tree methods for moving interfaces
.png){kind=icon}
PRE
AI
DOI：10.1006/jcph.1999.6205.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Fast adaptive numerical methods for solving moving interface problems are presented. The methods combine a level set approach with frequent redistancing and semi-Lagrangian time stepping schemes which are explicit yet unconditionally stable. A quadtree mesh is used to concentrate computational effort on the interface, so the methods move an interface with N degrees of freedom in O(N log N) work per time step. Efficiency is increased by taking large time steps even for parabolic curvature flows. The methods compute accurate viscosity solutions to a wide variety of difficult moving interface problems involving merging, anisotropy, faceting, and curvature. (C) 1999 Academic Press.
Keywords:
moving interfaces
level sets
adaptive mesh refinement
fast algorithms
semi-Lagrangian methods
CIR scheme
motion by curvature
Journal
IF:
3.8
Papers:
1.6W
Citations:
7.4W
Organization
No organization information available
Cited Papers
ShareSaveExome-wide evidence of compound heterozygous effects across common phenotypes in the UK Biobank.png)
OAAI
IF0
OAAIShareSaveIntraocular Concentration of Intravenous Prednisolone in Experimental Autoimmune Uveoretinitis Mice
PREAI
ShareSaveShareSaveShareSaveShareSave
View more