{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,26]],"date-time":"2026-04-26T00:49:22Z","timestamp":1777164562934,"version":"3.51.4"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2020,10,1]],"date-time":"2020-10-01T00:00:00Z","timestamp":1601510400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2020,10,1]],"date-time":"2020-10-01T00:00:00Z","timestamp":1601510400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Numer Algor"],"published-print":{"date-parts":[[2021,7]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Adaptive meshing is a fundamental component of adaptive finite element methods. This includes refining and coarsening meshes locally. In this work, we are concerned with the red-green-blue refinement strategy in two dimensions and its counterpart-coarsening. In general, coarsening algorithms are mostly based on an explicitly given refinement history. In this work, we present a coarsening algorithm on adaptive red-green-blue meshes in two dimensions without explicitly knowing the refinement history. To this end, we examine the local structure of these meshes, find an easy-to-verify criterion to adaptively coarsen red-green-blue meshes, and prove that this criterion generates meshes with the desired properties. We present a MATLAB implementation built on the red-green-blue refinement routine of the -package (Funken and Schmidt 2018, 2019).<\/jats:p>","DOI":"10.1007\/s11075-020-01003-7","type":"journal-article","created":{"date-parts":[[2020,10,1]],"date-time":"2020-10-01T18:03:47Z","timestamp":1601575427000},"page":"1147-1176","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["A coarsening algorithm on adaptive red-green-blue refined meshes"],"prefix":"10.1007","volume":"87","author":[{"given":"Stefan A.","family":"Funken","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anja","family":"Schmidt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,10,1]]},"reference":[{"issue":"1","key":"1003_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s002110050181","volume":"73","author":"RE Bank","year":"1996","unstructured":"Bank, R.E., Xu, J.: An algorithm for coarsening unstructured meshes. Numer. Math. 73(1), 1\u201336 (1996)","journal-title":"Numer. Math."},{"key":"1003_CR2","unstructured":"Bartels, S., Schreier, P.: Local coarsening of triangulations created by bisections. Univ. Freiburg, SFB 611 (2010)"},{"issue":"2","key":"1003_CR3","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/s00211-003-0492-7","volume":"97","author":"P Binev","year":"2004","unstructured":"Binev, P., Dahmen, W., DeVore, R.: Adaptive finite element methods with convergence rates. Numer. Math. 97(2), 219\u2013268 (2004)","journal-title":"Numer. Math."},{"issue":"4","key":"1003_CR4","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1007\/s00365-003-0550-5","volume":"20","author":"C Carstensen","year":"2004","unstructured":"Carstensen, C.: An adaptive mesh-refining algorithm allowing for an H1-stable L2-projection onto Courant finite element spaces. Constr. Approx. 20(4), 549\u2013564 (2004)","journal-title":"Constr. Approx."},{"issue":"6","key":"1003_CR5","doi-asserted-by":"publisher","first-page":"1195","DOI":"10.1016\/j.camwa.2013.12.003","volume":"67","author":"C Carstensen","year":"2014","unstructured":"Carstensen, C., Feischl, M., Page, M., Praetorius, D.: Axioms of adaptivity. Comput. Math. Appl. 67(6), 1195\u20131253 (2014)","journal-title":"Comput. Math. Appl."},{"issue":"5","key":"1003_CR6","doi-asserted-by":"publisher","first-page":"2524","DOI":"10.1137\/07069047X","volume":"46","author":"JM Cascon","year":"2008","unstructured":"Cascon, J.M., Kreuzer, C., Nochetto, R.H., Siebert, K.G.: Quasi-optimal convergence rate for an adaptive finite element method. SIAM J. Numer. Anal. 46(5), 2524\u20132550 (2008)","journal-title":"SIAM J. Numer. Anal."},{"key":"1003_CR7","doi-asserted-by":"crossref","unstructured":"Chen, L., Zhang, C.: A coarsening algorithm on adaptive grids by newest vertex bisection and its applications. J. Comput. Math. pp 767\u2013789 (2010)","DOI":"10.4208\/jcm.1004-m3172"},{"key":"1003_CR8","doi-asserted-by":"crossref","unstructured":"Ciarlet, P.G.: The finite element method for elliptic problems. SIAM (2002)","DOI":"10.1137\/1.9780898719208"},{"issue":"4","key":"1003_CR9","doi-asserted-by":"publisher","first-page":"460","DOI":"10.2478\/cmam-2011-0026","volume":"11","author":"SA Funken","year":"2011","unstructured":"Funken, S.A., Praetorius, D., Wissgott, P.: Efficient implementation of adaptive p1-FEM in Matlab. Comput. Methods Appl. Math. 11(4), 460\u2013490 (2011)","journal-title":"Comput. Methods Appl. Math."},{"key":"1003_CR10","unstructured":"Funken, S.A., Schmidt, A.: ameshcoars \u2013 Efficient Implementation of Adaptive Mesh Coarsening in 2D. Software download at https:\/\/github.com\/aschmidtuulm\/ameshcoars (2020)"},{"key":"1003_CR11","unstructured":"Funken, S.A., Schmidt, A.: ameshref \u2013 Efficient Implementation of Adaptive Mesh Refinement in 2D. Software download at https:\/\/github.com\/aschmidtuulm\/ameshref (2018)"},{"key":"1003_CR12","doi-asserted-by":"crossref","unstructured":"Funken, S.A., Schmidt, A.: Adaptive mesh refinement in 2D\u2013An efficient implementation in matlab. Comput. Methods Appl. Math. (2018)","DOI":"10.1515\/cmam-2018-0220"},{"key":"1003_CR13","doi-asserted-by":"crossref","unstructured":"Funken, S.A., Schmidt, A.: Ameshref: a Matlab-Toolbox for adaptive mesh refinement in two dimensions. In: Numerical Geometry, Grid Generation and Scientific Computing, pp. 269\u2013279. Springer (2019)","DOI":"10.1007\/978-3-030-23436-2_20"},{"key":"1003_CR14","doi-asserted-by":"crossref","unstructured":"Karkulik, M., Pavlicek, D., Praetorius, D.: On 2d newest vertex bisection: Optimality of mesh-closure and H1-stability of L2-projection. ASC report 10\/2012 Vienna University of Technology (2012)","DOI":"10.1007\/s00365-013-9192-4"},{"issue":"2","key":"1003_CR15","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/s00365-013-9192-4","volume":"38","author":"M Karkulik","year":"2013","unstructured":"Karkulik, M., Pavlicek, D., Praetorius, D.: On 2D newest vertex bisection: optimality of mesh-closure and H 1-stability of L 2-projection. Constr. Approx. 38(2), 213\u2013234 (2013)","journal-title":"Constr. Approx."},{"issue":"3","key":"1003_CR16","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1016\/0377-0427(94)90034-5","volume":"55","author":"I Kossaczky\u0300","year":"1994","unstructured":"Kossaczky\u0300, I.: A recursive approach to local mesh refinement in two and three dimensions. J. Comput. Appl. Math. 55(3), 275\u2013288 (1994)","journal-title":"J. Comput. Appl. Math."},{"key":"1003_CR17","first-page":"413","volume":"110","author":"D Mavriplis","year":"1988","unstructured":"Mavriplis, D., Jameson, A.: Multigrid solution of the Euler equations on unstructured and adaptive meshes. Multigrid methods: Theory, Applications, and Supercomputing, SF McCormick, ed 110, 413\u2013429 (1988)","journal-title":"Multigrid methods: Theory, Applications, and Supercomputing, SF McCormick, ed"},{"key":"1003_CR18","doi-asserted-by":"crossref","unstructured":"Nochetto, R.H., Siebert, K.G., Veeser, A.: Theory of adaptive finite element methods: an introduction. In: Multiscale, Nonlinear and Adaptive Approximation, pp. 409\u2013542. Springer (2009)","DOI":"10.1007\/978-3-642-03413-8_12"},{"key":"1003_CR19","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1002\/nme.682","volume":"57","author":"C Ollivier-Gooch","year":"2003","unstructured":"Ollivier-Gooch, C.: Coarsening unstructured meshes by edge contraction. Int. J. Numer. Methods Eng. 57, 391\u2013414 (2003). https:\/\/doi.org\/10.1002\/nme.682","journal-title":"Int. J. Numer. Methods Eng."},{"key":"1003_CR20","unstructured":"Pavlicek, D.: Optimalitat adaptiver FEM, Bachelor Thesis (in German).\u0308 Institute for Analysis and Scientific Computing Vienna University of Technology (2010)"},{"key":"1003_CR21","unstructured":"Praetorius, D., Weinm\u00fcller, E., Wissgott, P.: A space-time adaptive algorithm for linear parabolic problems. ASC report 07\/2008 Vienna University of Technology (2008)"},{"key":"1003_CR22","unstructured":"Schmidt, A.: Adaptive Mesh Refinement in 2D \u2013 an Efficient Implementation in Matlab for Triangular and Quadrilateral Meshes. Master\u2019s thesis, Universit\u00e4t Ulm (2018)"},{"key":"1003_CR23","doi-asserted-by":"publisher","unstructured":"Schmidt, A., Siebert, K.G.: Design of Adaptive Finite Element Software - The Finite Element Toolbox ALBERTA, Lect. Notes Comput. Sci. Eng., vol. 42, Springer. https:\/\/doi.org\/10.1007\/b138692 (2005)","DOI":"10.1007\/b138692"},{"key":"1003_CR24","unstructured":"Schneiders, R.: Mesh generation and grid generation on the web. http:\/\/www.robertschneiders.de\/meshgeneration\/meshgeneration.html. Accessed: 2020-01-09"},{"key":"1003_CR25","unstructured":"Sewell, E.: Automatic Generation of Triangulations for Piecewise Polynomial Approximation. Purdue University. https:\/\/books.google.de\/books?id=zaJfnQEACAAJ (1972)"},{"issue":"4","key":"1003_CR26","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1631\/jzus.A0820229","volume":"10","author":"ZY Shu","year":"2009","unstructured":"Shu, Z.Y., Wang, G.Z., Dong, C.S.: Adaptive triangular mesh coarsening with centroidal voronoi tessellations. J. Zhejiang Univ. Sci. A 10(4), 535\u2013545 (2009). https:\/\/doi.org\/10.1631\/jzus.A0820229","journal-title":"J. Zhejiang Univ. Sci. A"},{"issue":"261","key":"1003_CR27","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1090\/S0025-5718-07-01959-X","volume":"77","author":"R Stevenson","year":"2008","unstructured":"Stevenson, R.: The completion of locally refined simplicial partitions created by bisection. Math. Comput. 77(261), 227\u2013241 (2008)","journal-title":"Math. Comput."}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-020-01003-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11075-020-01003-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-020-01003-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,1]],"date-time":"2021-10-01T01:47:06Z","timestamp":1633052826000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11075-020-01003-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,10,1]]},"references-count":27,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2021,7]]}},"alternative-id":["1003"],"URL":"https:\/\/doi.org\/10.1007\/s11075-020-01003-7","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"value":"1017-1398","type":"print"},{"value":"1572-9265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,10,1]]},"assertion":[{"value":"20 January 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 August 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 October 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}