{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T17:28:15Z","timestamp":1787333295637,"version":"build-2736575974"},"reference-count":42,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Sci. Comput."],"published-print":{"date-parts":[[2010,1]]},"abstract":"<jats:p>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\u201317]. 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.<\/jats:p>","DOI":"10.1137\/090772022","type":"journal-article","created":{"date-parts":[[2010,7,22]],"date-time":"2010-07-22T18:07:03Z","timestamp":1279822023000},"page":"2099-2120","source":"Crossref","is-referenced-by-count":13,"title":["Adaptive Finite Element Methods on Quadrilateral Meshes without Hanging Nodes"],"prefix":"10.1137","volume":"32","author":[{"given":"Xuying","family":"Zhao","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shipeng","family":"Mao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhongci","family":"Shi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2010,7,22]]},"reference":[{"key":"R1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cma.2006.10.020"},{"key":"R2","doi-asserted-by":"publisher","DOI":"10.1137\/S0036142901391128"},{"key":"R3","doi-asserted-by":"publisher","DOI":"10.1137\/S1064827597323373"},{"key":"R4","doi-asserted-by":"publisher","DOI":"10.1016\/0045-7825(94)00718-3"},{"key":"R5","unstructured":"R. E. Bank,\n                      PLTMG: A Software Package for Solving Elliptic Partial Differential Equations: User's Guide\n                      6.0, SIAM, Philadelphia, 1990."},{"key":"R6","unstructured":"R. E. Bank, A. H. Sherman, and A. Weiser,\n                      Refinement algorithms and data structures for regular local mesh refinement\n                      , in Scientific Computing: Applications of Mathematics and Computing to the Physical Sciences, R. S. Stepleman, ed., North-Holland, Amsterdam, 1983, pp. 3\u201317."},{"key":"R7","unstructured":"R. E. Bank,\n                      The efficient implementation of local mesh refinement algorithms\n                      , in Adaptive Computational Methods for Partial Differential Equations, I. Babuska, J. Chandra, J. E. Flaherty, eds., Philadelphia, SIAM, 1983, pp. 74\u201381."},{"key":"R8","doi-asserted-by":"publisher","DOI":"10.1016\/0899-8248(91)90006-G"},{"key":"R9","doi-asserted-by":"publisher","DOI":"10.1007\/BF02238487"},{"key":"R10","doi-asserted-by":"publisher","DOI":"10.1007\/s002110050475"},{"key":"R11","doi-asserted-by":"publisher","DOI":"10.1007\/s00211-003-0492-7"},{"key":"R12","doi-asserted-by":"publisher","DOI":"10.1002\/nme.1620361808"},{"key":"R13","unstructured":"J. Cervenka,\n                      Three-Dimensional Mesh Generation for Device and Process Simulation\n                      , Ph.D. thesis, Universit\u00e4t Wien, Vienna, 2004, http:\/\/www.iue.tuwien.ac.at\/phd\/cervenka\/node14.html."},{"key":"R14","doi-asserted-by":"crossref","unstructured":"S. H. Chou and S. N. He,\n                      On the regularity and uniformness conditions on quadrilateral grids\n                      , Comput. Methods Appl. Mech. Engrg., 191 (2002) pp. 5149\u20135158.","DOI":"10.1016\/S0045-7825(02)00357-2"},{"key":"R15","doi-asserted-by":"crossref","unstructured":"P. G. Ciarlet,\n                      The Finite Element Method for Elliptic Problwms\n                      , North-Holland, Amsterdam, 1978.","DOI":"10.1115\/1.3424474"},{"key":"R16","doi-asserted-by":"publisher","DOI":"10.1137\/0733054"},{"key":"R17","unstructured":"P. Fleischmann,\n                      Mesh Generation for Technology CAD in Three Dimensions\n                      , Ph.D. thesis, Technische Universit\u00e4t Wien, Vienna, 2009, http:\/\/www.iue.tuwien.ac.at\/phd\/fleischmann\/node23.html."},{"key":"R18","doi-asserted-by":"crossref","unstructured":"V. Girault and P. A. Raviart,\n                      Finite Element Methods for Navier-Stokes Equations, Theory and Algorithm\n                      , Springer, Berlin, 1986.","DOI":"10.1007\/978-3-642-61623-5"},{"key":"R19","doi-asserted-by":"publisher","DOI":"10.1007\/s00607-007-0233-3"},{"key":"R20","doi-asserted-by":"publisher","DOI":"10.1016\/0377-0427(94)90034-5"},{"key":"R21","doi-asserted-by":"crossref","unstructured":"E. Leitner and S. Selberherr,\n                      Three-dimensional grid adaptation using a mixed-element decomposition method\n                      , in Simulation of Semiconductor Devices and Processes, Vol. 6, H. Ryssel and P. Pichler, eds., Springer, Wien, Austria, 1995, pp. 464\u2013467.","DOI":"10.1007\/978-3-7091-6619-2_112"},{"key":"R22","doi-asserted-by":"publisher","DOI":"10.1137\/070700486"},{"key":"R23","doi-asserted-by":"publisher","DOI":"10.1007\/s00607-002-1451-3"},{"key":"R24","doi-asserted-by":"publisher","DOI":"10.1137\/0916014"},{"key":"R25","doi-asserted-by":"publisher","DOI":"10.1142\/S0252959902000237"},{"key":"R26","doi-asserted-by":"publisher","DOI":"10.1016\/S0045-7825(02)00471-1"},{"key":"R27","doi-asserted-by":"crossref","unstructured":"W. F. Mitchell,\n                      Adaptive refinement for arbitrary finite element spaces with hierarchical basis\n                      , J. Comput. Appl. Math., 36 (1991) pp. 65\u201378.","DOI":"10.1016\/0377-0427(91)90226-A"},{"key":"R28","unstructured":"W. F. Mitchell,\n                      Unified Multilevel Adaptive Finite Element Methods for Elliptic Problems\n                      , Ph.D. thesis, University of Illinois at Urbana-Champaign, 1988."},{"key":"R29","unstructured":"N. Molino, R. Bridson, J. Teran, and R. Fedkiw,\n                      A Crystalline, Red Green Strategy for Meshing Highly Deformable Objects with Tetrahedra\n                      , in 12th International Meshing Roundtable, Sandia National Laboratories, Livermore, CA, 2003, pp. 103\u2013114."},{"key":"R30","doi-asserted-by":"publisher","DOI":"10.1016\/S0168-9274(99)00022-7"},{"key":"R31","doi-asserted-by":"publisher","DOI":"10.1016\/S0168-9274(99)00060-4"},{"key":"R32","doi-asserted-by":"publisher","DOI":"10.1137\/0721042"},{"key":"R33","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1097-0207(19970228)40:4<581::AID-NME45>3.0.CO;2-K"},{"key":"R34","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-96-00772-7"},{"key":"R35","doi-asserted-by":"crossref","unstructured":"M. C. Rivara and M. Venere,\n                      Cost analysis of the longest-side (triangle bisection) refinement algorithms for triangulations\n                      , Engrg. with Comput., 12 (1996) pp. 224\u2013234.","DOI":"10.1007\/BF01198736"},{"key":"R36","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-1975-0375068-5"},{"key":"R37","unstructured":"E. G. Sewell,\n                      Automatic Generation of Triangulations for Piecewise Polynomial Approximation\n                      , Ph.D. dissertation, Purdue University, West Lafayette, IN, 1972."},{"key":"R38","doi-asserted-by":"publisher","DOI":"10.1007\/BF01405567"},{"key":"R39","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-07-01959-X"},{"key":"R40","doi-asserted-by":"publisher","DOI":"10.1007\/BF02684475"},{"key":"R41","doi-asserted-by":"publisher","DOI":"10.1007\/s11425-009-0200-x"},{"key":"R42","doi-asserted-by":"publisher","DOI":"10.4208\/jcm.1001-m3006"}],"container-title":["SIAM Journal on Scientific Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/090772022","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T16:48:44Z","timestamp":1787330924000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/090772022"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,1]]},"references-count":42,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2010,1]]}},"alternative-id":["10.1137\/090772022"],"URL":"https:\/\/doi.org\/10.1137\/090772022","relation":{},"ISSN":["1064-8275","1095-7197"],"issn-type":[{"value":"1064-8275","type":"print"},{"value":"1095-7197","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,1]]}}}