Abstract

In recent work, Li et al.\ (Comm.\ Math.\ Sci., 7:81-107, 2009) developed a diffuse-domain method (DDM) for solving partial differential equations in complex, dynamic geometries with Dirichlet, Neumann, and Robin boundary conditions. The diffuse-domain method uses an implicit representation of the geometry where the sharp boundary is replaced by a diffuse layer with thickness $\epsilon$ that is typically proportional to the minimum grid size. The original equations are reformulated on a larger regular domain and the boundary conditions are incorporated via singular source terms. The resulting equations can be solved with standard finite difference and finite element software packages. Here, we present a matched asymptotic analysis of general diffuse-domain methods for Neumann and Robin boundary conditions. Our analysis shows that for certain choices of the boundary condition approximations, the DDM is second-order accurate in $\epsilon$. However, for other choices the DDM is only first-order accurate. This helps to explain why the choice of boundary-condition approximation is important for rapid global convergence and high accuracy. Our analysis also suggests correction terms that may be added to yield more accurate diffuse-domain methods. Simple modifications of first-order boundary condition approximations are proposed to achieve asymptotically second-order accurate schemes. Our analytic results are confirmed numerically in the $L^2$ and $L^\infty$ norms for selected test problems.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.