Abstract
In this paper we propose a mesh algorithm to generate a regular and conformal family of nested triangulations for a planar domain divided into two non-convex polygonal subdomains by a prefractal Koch type interface. The presence of the interface, a polygonal curve, induces a natural triangulation in which the vertices of the prefractal are also nodes of the triangulation. In order to achieve an optimal rate of convergence of the numerical approximation a suitably refined mesh around the reentrant corners is required. This is achieved by generating a mesh compliant with the Grisvard's condition. We present the mesh algorithm and a detailed proof of the Grisvard conditions.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
