Abstract
Hanging nodes have some disadvantages in the implementation of adaptive finite element methods on quadrilateral meshes, which usually need further techniques to treat them. In this paper, we present a shape regular local refinement algorithm on quadrilateral meshes without hanging nodes, which can be viewed as an extension of the original red-green refinement proposed by Bank, Sherman, and Weiser [Refinement algorithms and data structures for regular local mesh refinement, in Scientific Computing: Applications of Mathematics and Computing to the Physical Sciences, R. S. Stepleman, ed., North-Holland, Amsterdam, 1983, pp. 3-17]. We also prove this quadrilateral red-green refinement can hold the shape regularity and conformity of quadrilateral meshes. Furthermore, we have successfully accomplished the adaptive finite element computation on quadrilateral meshes without hanging nodes. Numerical results show that the adaptive algorithm with this red-green refinement is quasi-optimal. Some properties of this local refinement on quadrilateral meshes are also covered in this paper.
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.
