.png){kind=icon}
Return
Delta function approximations in level set methods by distance function extension
.png){kind=icon}
PRE
AI
DOI：10.1016/j.jcp.2009.11.030.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In [A.-K. Tornberg, B. Engquist, Numerical approximations of singular source terms in differential equations, J. Comput. Phys. 200 (2004) 462-488], it was shown for simple examples that the then most common way to regularize delta functions in connection to level set methods produces inconsistent approximations with errors that are not reduced with grid refinement. Since then, several clever approximations have been derived to overcome this problem. However, the great appeal of the old method was its simplicity. In this paper it is shown that the old method - a one-dimensional delta function approximation extended to higher dimensions by a distance function - can be made accurate with a different class of one-dimensional delta function approximations. The prize to pay is a wider support of the resulting delta function approximations. (C) 2009 Elsevier Inc. All rights reserved.
Keywords:
Level set method
Delta function
Consistent approximations
Discretization
Distance function
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.8
Papers:
1.6W
Citations:
7.4W
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSave
View more