arxiv: 2605.04805 · v1 · submitted 2026-05-06 · 🧮 math.NA · cs.NA

Recognition: unknown

An Adaptive Finite Element Method Based on Generalized Barycentric Coordinates

Yihui Zhou, Yuwen Li

Pith reviewed 2026-05-08 16:17 UTC · model grok-4.3

classification 🧮 math.NA cs.NA

keywords polygonal finite elementsWachspress barycentric coordinatesa posteriori error estimatesadaptive finite element methodsresidual-based estimatorScott-Zhang interpolation

0 comments

The pith

The residual-based a posteriori error estimator bounds the discretization error from both above and below for polygonal finite elements that use Wachspress barycentric coordinates.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

This paper proves that a standard residual-based error estimator is reliable and efficient for adaptive refinement in finite element methods on polygonal meshes. The methods in question employ Wachspress generalized barycentric coordinates to construct shape functions over arbitrary polygons rather than triangles or quadrilaterals. Establishing both upper and lower bounds on the true discretization error justifies driving mesh adaptation directly from the estimator. Experiments on square and L-shaped domains show the resulting adaptive algorithm reduces error as expected. The result matters for simulations that benefit from flexible polygonal meshes in complex geometries.

Core claim

We derive a posteriori error estimates of polygonal finite element methods based on Wachspress barycentric coordinates. In particular, we prove that the classical residual-based a posteriori error estimator is both an upper and lower bound for the discretization error. The analysis relies on a Scott-Zhang type interpolation and homogeneity arguments for rational functions on polygonal elements. Numerical experiments on square and L-shaped domains demonstrate the effectiveness of the adaptive algorithm.

What carries the argument

Wachspress barycentric coordinates on polygonal elements together with the residual-based a posteriori error estimator, proved equivalent to the true error via Scott-Zhang interpolation.

If this is right

The residual estimator can be used directly to mark elements for refinement in adaptive polygonal finite element codes.
Optimal convergence rates for the adaptive algorithm follow from the proven equivalence of estimator and error.
The same estimator applies without change to meshes containing both convex and non-convex polygons.
Standard adaptive finite element software frameworks can incorporate polygonal elements once this bound is available.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

Similar bounds may hold for other families of generalized barycentric coordinates provided they admit comparable interpolation operators.
The technique could extend to three-dimensional polyhedral elements if homogeneity arguments carry over to tetrahedral or hexahedral decompositions.
Adaptive polygonal meshes might reduce the total number of degrees of freedom needed for a given accuracy in problems with curved boundaries.

Load-bearing premise

The proof depends on the existence of a Scott-Zhang type interpolation operator and the homogeneity properties of rational functions defined on polygonal elements.

What would settle it

Numerical computation on a sequence of refined polygonal meshes where the ratio of the residual estimator to the true error fails to remain bounded above and below by positive constants independent of mesh size.

Figures

Figures reproduced from arXiv: 2605.04805 by Yihui Zhou, Yuwen Li.

read the original abstract

This work derives a posteriori error estimate of polygonal finite element methods based on Wachspress barycentric coordinates. In particular, we prove that the classical residual-based a posteriori error estimator is both an upper and lower bounds for the discretization error. The analysis relies a Scott-Zhang type interpolation and homogeneity arguments for rational functions on polygonal elements. Numerical experiments on square and L-shaped domains demonstrate the effectiveness of the adaptive algorithm.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Desk Editor's Note private letter to a colleague

The paper proves reliability and efficiency for residual estimators on Wachspress polygonal elements, but the rational homogeneity step may not deliver uniform constants.

read the letter

The main takeaway is that this work derives both upper and lower bounds for the classical residual a posteriori estimator in finite element methods on polygons using Wachspress barycentric coordinates. The proof adapts Scott-Zhang interpolation and scaling arguments to the rational functions that arise on general polygons, which is a specific step not already in the triangular or quadrilateral literature they cite. The numerical experiments on the square and L-shaped domains show the adaptive algorithm reducing the error as expected near the reentrant corner, which is the practical test that matters for this kind of method. That part is done cleanly and gives concrete evidence the estimator drives useful refinement. The soft spot sits in the efficiency bound. Wachspress coordinates are rational, so the usual polynomial homogeneity identity does not transfer verbatim; the scaling depends on the specific rational expression and the local geometry. The paper invokes homogeneity arguments for rational functions, but if the resulting constants grow with the number of sides or the aspect ratios that appear under adaptive refinement, the lower bound constant becomes mesh-dependent. That would make the claimed equivalence between estimator and true error weaker than stated for the adaptive setting. The abstract does not give the explicit lemma that would rule this out, so the full paper needs to show the constants stay controlled. This is aimed at researchers already working on polygonal elements and a posteriori estimates in computational mechanics. Someone who knows residual estimators on standard meshes will follow the extension without trouble and can judge the scaling step against their own experience. It is worth sending to peer review because the claim is narrow and checkable, the numerics are relevant, and the potential gap in the constants is exactly the sort of thing referees in this area can verify quickly.

Referee Report

2 major / 2 minor

Summary. The paper develops an adaptive finite element method on polygonal meshes using Wachspress generalized barycentric coordinates. It claims to prove that the classical residual-based a posteriori error estimator provides both upper and lower bounds on the discretization error (in the energy norm). The analysis relies on a Scott-Zhang-type quasi-interpolant combined with homogeneity arguments adapted to the rational Wachspress functions on polygonal elements. Numerical experiments on square and L-shaped domains are presented to demonstrate the effectiveness of the resulting adaptive algorithm.

Significance. If the central equivalence between the residual estimator and the true error holds with mesh-independent constants, the work would provide a valuable theoretical extension of residual-based a posteriori control to polygonal FEM with non-polynomial rational basis functions. This is useful for adaptive meshing of complex domains. The numerical results on the L-shaped domain with a reentrant corner give practical support for the adaptive procedure, but the significance depends on confirming uniformity of the efficiency constants.

major comments (2)

[Abstract and a posteriori error analysis section] Abstract and the section on a posteriori error analysis: The claim that the residual estimator is an efficient lower bound relies on homogeneity arguments for rational Wachspress functions, but no explicit lemma or derivation is supplied showing that the scaling constants remain independent of the number of sides and the aspect ratios of the polygons. Wachspress coordinates are rational (numerator and denominator both of degree equal to the number of sides), so the standard polynomial scaling identity does not apply directly; without a uniform bound the efficiency constant may deteriorate under adaptive refinement near the L-shaped reentrant corner.
[Scott-Zhang interpolation subsection] The section detailing the Scott-Zhang quasi-interpolant: The application of the Scott-Zhang operator to the Wachspress finite element space on general polygons requires explicit verification that the operator is stable and reproduces the space with constants independent of the local geometry; the manuscript invokes the operator but does not provide the necessary estimates or assumptions on the polygonal mesh family that would guarantee this.

minor comments (2)

[Abstract] The abstract states that the estimator 'is both an upper and lower bounds' but should explicitly name the norm (energy norm) and clarify that the constants are claimed to be independent of the mesh.
[Numerical experiments] Numerical experiments section: The description of how the residual estimator is assembled for the rational Wachspress basis functions is brief; adding a short algorithmic outline or reference to the quadrature used would improve reproducibility.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We are grateful to the referee for the insightful comments and for recognizing the potential value of our work on adaptive polygonal finite element methods. We provide point-by-point responses to the major comments and outline the revisions we will make to strengthen the manuscript.

read point-by-point responses

Referee: [Abstract and a posteriori error analysis section] Abstract and the section on a posteriori error analysis: The claim that the residual estimator is an efficient lower bound relies on homogeneity arguments for rational Wachspress functions, but no explicit lemma or derivation is supplied showing that the scaling constants remain independent of the number of sides and the aspect ratios of the polygons. Wachspress coordinates are rational (numerator and denominator both of degree equal to the number of sides), so the standard polynomial scaling identity does not apply directly; without a uniform bound the efficiency constant may deteriorate under adaptive refinement near the L-shaped reentrant corner.

Authors: We agree that an explicit derivation of the homogeneity properties for the rational Wachspress functions is necessary to establish the mesh-independent efficiency constant. Although the manuscript adapts the standard scaling arguments to the rational case by factoring out the homogeneous degrees in the numerator and denominator separately, we acknowledge that this step was not presented as a standalone lemma. In the revised manuscript, we will insert a new lemma in the a posteriori error analysis section that rigorously shows the scaling constants are bounded independently of the number of sides and the aspect ratios, under the assumption that the polygonal elements satisfy a uniform shape-regularity condition (e.g., bounded aspect ratio and minimum interior angle). This will directly address the concern about potential deterioration near the reentrant corner. revision: yes
Referee: [Scott-Zhang interpolation subsection] The section detailing the Scott-Zhang quasi-interpolant: The application of the Scott-Zhang operator to the Wachspress finite element space on general polygons requires explicit verification that the operator is stable and reproduces the space with constants independent of the local geometry; the manuscript invokes the operator but does not provide the necessary estimates or assumptions on the polygonal mesh family that would guarantee this.

Authors: The manuscript applies the Scott-Zhang quasi-interpolant because the Wachspress space includes all linear polynomials, allowing reproduction of the finite element functions in the usual way. However, we recognize that explicit stability estimates with constants independent of the local polygonal geometry are essential for the reliability proof. In the revision, we will add the required estimates, including a proof that the operator is stable in the energy norm with constants depending only on the shape-regularity parameters of the mesh family. We will also state the precise assumptions on the polygonal mesh (such as the existence of a uniform bound on the number of sides and aspect ratios) that ensure these constants remain uniform. revision: yes

Circularity Check

0 steps flagged

No significant circularity; proof relies on external standard interpolation theory

full rationale

The paper's central claim is a mathematical proof that the classical residual-based a posteriori error estimator provides both upper and lower bounds on the discretization error for polygonal FEM using Wachspress coordinates. The derivation explicitly invokes a Scott-Zhang type quasi-interpolant and homogeneity arguments for rational functions, which are standard external techniques from approximation theory rather than self-definitions, fitted parameters renamed as predictions, or load-bearing self-citations. No equations reduce the claimed equivalence to the paper's own inputs by construction, and the provided abstract and claims contain no ansatz smuggling or renaming of known results. This matches the expected honest non-finding for a proof paper whose analysis is self-contained against external benchmarks.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The central claim rests on standard finite element interpolation theory and specific homogeneity properties of Wachspress rational functions; no free parameters or new entities are introduced in the abstract.

axioms (2)

domain assumption Existence and stability of a Scott-Zhang type interpolation operator on polygonal finite element spaces
Invoked to relate the discrete solution to the exact solution in the error analysis.
domain assumption Homogeneity arguments apply to the rational functions arising from Wachspress barycentric coordinates on polygonal elements
Used to establish equivalence between the residual estimator and the true error norm.

pith-pipeline@v0.9.0 · 5352 in / 1198 out tokens · 82528 ms · 2026-05-08T16:17:57.697579+00:00 · methodology

discussion (0)

Reference graph

Works this paper leans on

54 extracted references · 4 canonical work pages

[1]

Tinsley Oden

Mark Ainsworth and J. Tinsley Oden. A posteriori error estimation in ﬁnite element analysis. Pure and Applied Mathematics (New York). Wiley-Interscie nce [John Wiley & Sons], New York, 2000

2000
[2]

Arnold, Franco Brezzi, Bernardo Cockburn, and L

Douglas N. Arnold, Franco Brezzi, Bernardo Cockburn, and L. Donatella Marini. Uniﬁed analysis of discontinuous Galerkin methods for elliptic pr oblems. SIAM J. Numer. Anal., 39(5):1749–1779, 2001/02

2001
[3]

Randolph E. Bank. Hierarchical bases and the ﬁnite elemen t method. In Acta numerica, 1996, volume 5 of Acta Numer. , pages 1–43. Cambridge Univ. Press, Cambridge, 1996

1996
[4]

Bank and Yuwen Li

Randolph E. Bank and Yuwen Li. Superconvergent recovery o f Raviart-Thomas mixed ﬁnite elements on triangular grids. J. Sci. Comput. , 81(3):1882–1905, 2019

1905
[5]

Bank and R

Randolph E. Bank and R. Kent Smith. A posteriori error esti mators based on hierar- chical bases. SIAM J. Numer. Anal. , 30(4):921–935, 1993

1993
[6]

An optimal control appr oach to a posteriori error estimation in ﬁnite element methods

Roland Becker and Rolf Rannacher. An optimal control appr oach to a posteriori error estimation in ﬁnite element methods. Acta Numer. , 10:1–102, 2001

2001
[7]

Donatella Ma rini, and Alessandro Russo

Lourenco Beir˜ ao da Veiga, Franco Brezzi, L. Donatella Ma rini, and Alessandro Russo. The virtual element method. Acta Numer. , 32:123–202, 2023

2023
[8]

Residua l a posteriori error estima- tion for the virtual element method for elliptic problems

Lourenco Beir˜ ao da Veiga and Gianmarco Manzini. Residua l a posteriori error estima- tion for the virtual element method for elliptic problems. ESAIM Math. Model. Numer. Anal., 49(2):577–599, 2015

2015
[9]

A posteriori error estimation and adaptivity in hp virtual elements

Lourenco Beir˜ ao da Veiga, Gianmarco Manzini, and Lorenz o Mascotto. A posteriori error estimation and adaptivity in hp virtual elements. Numer. Math. , 143(1):139–175, 2019

2019
[10]

A residual a posteriori error estimate for the Virtual Element Method

Stefano Berrone and Andrea Borio. A residual a posteriori error estimate for the Virtual Element Method. Math. Models Methods Appl. Sci. , 27(8):1423–1458, 2017. 22 Y. Zhou and Y. Li

2017
[11]

Stabilization-free HHO a posteriori error control

Fleurianne Bertrand, Carsten Carstensen, Benedikt Gr¨ aß le, and Ngoc Tien Tran. Stabilization-free HHO a posteriori error control. Numer. Math. , 154(3-4):369–408, 2023

2023
[12]

Equilibrated residual error estimates are p-robust

Dietrich Braess, Veronika Pillwein, and Joachim Sch¨ ob erl. Equilibrated residual error estimates are p-robust. Comput. Methods Appl. Mech. Engrg. , 198(13-14):1189–1197, 2009

2009
[13]

Georgoulis, Tristan Pryer , and Oliver J

Andrea Cangiani, Emmanuil H. Georgoulis, Tristan Pryer , and Oliver J. Sutton. A posteriori error estimates for the virtual element method. Numer. Math. , 137(4):857– 893, 2017

2017
[14]

A posteriori error estima tes for the ﬁnite element discretization of second-order PDEs set in unbounded domai ns

Th´ eophile Chaumont-Frelet. A posteriori error estima tes for the ﬁnite element discretization of second-order PDEs set in unbounded domai ns. arXiv preprint arXiv:2503.22297, 2025

work page arXiv 2025
[15]

Generalised gradi- ents for virtual elements and applications to a posteriori e rror analysis

Th´ eophile Chaumont-Frelet, Joscha Gedicke, and Lorenzo Mascotto. Generalised gradi- ents for virtual elements and applications to a posteriori e rror analysis. arXiv preprint , arXiv:2408.03148, 2025

work page arXiv 2025
[16]

A posteriori error es timates for weak Galerkin ﬁnite element methods for second order elliptic problems

Long Chen, Junping W ang, and Xiu Ye. A posteriori error es timates for weak Galerkin ﬁnite element methods for second order elliptic problems. J. Sci. Comput. , 59(2):496– 511, 2014

2014
[17]

A conforming quadratic po lygonal element and its application to Stokes equations

Xinjiang Chen and Yanqiu W ang. A conforming quadratic po lygonal element and its application to Stokes equations. J. Comput. Math. , 40(4):624–648, 2022

2022
[18]

Uniﬁed hy- bridization of discontinuous Galerkin, mixed, and continu ous Galerkin methods for second order elliptic problems

Bernardo Cockburn, Jayadeep Gopalakrishnan, and Raytc ho Lazarov. Uniﬁed hy- bridization of discontinuous Galerkin, mixed, and continu ous Galerkin methods for second order elliptic problems. SIAM J. Numer. Anal. , 47(2):1319–1365, 2009

2009
[19]

Ada ptive virtual element methods with equilibrated ﬂuxes

Franco Dassi, Joscha Gedicke, and Lorenzo Mascotto. Ada ptive virtual element methods with equilibrated ﬂuxes. Appl. Numer. Math. , 173:249–278, 2022

2022
[20]

An arbitrary-order discrete de Rham complex on polyhedral meshes: Exactness, Poincar´ e inequalities, and consistency

Daniele A Di Pietro and J´ erˆ ome Droniou. An arbitrary-order discrete de Rham complex on polyhedral meshes: Exactness, Poincar´ e inequalities, and consistency. Foundations of Computational Mathematics , 23(1):85–164, 2023

2023
[21]

Hybrid high-order methods for variable- diﬀusion problems on general meshes

Daniele A Di Pietro and Alexandre Ern. Hybrid high-order methods for variable- diﬀusion problems on general meshes. Comptes Rendus Math´ ematique, 353(1):31–34, 2015

2015
[22]

Virtual element method with adaptive reﬁnement for problems of two- dimensional complex topology models from an engineering perspective

Xiaoxiao Du, W ei W ang, Gang Zhao, Jiaming Yang, Mayi Guo, and Ran Zhang. Virtual element method with adaptive reﬁnement for problems of two- dimensional complex topology models from an engineering perspective. Comput. Mech., 70(3):581–606, 2022

2022
[23]

Polynomial-degree -robust a posteriori estimates in a uniﬁed setting for conforming, nonconforming, discont inuous Galerkin, and mixed discretizations

Alexandre Ern and Martin Vohral ´ ık. Polynomial-degree -robust a posteriori estimates in a uniﬁed setting for conforming, nonconforming, discont inuous Galerkin, and mixed discretizations. SIAM J. Numer. Anal. , 53(2):1058–1081, 2015

2015
[24]

Michael S. Floater. Generalized barycentric coordinat es and applications. Acta Numer- ica, 24:161–214, 2015

2015
[25]

Floater and Jiˇ r ´ ı Kosinka

Michael S. Floater and Jiˇ r ´ ı Kosinka. On the injectivity of Wachspress and mean value mappings between convex polygons. Adv. Comput. Math. , 32(2):163–174, 2010

2010
[26]

Floater and Ming-Jun Lai

Michael S. Floater and Ming-Jun Lai. Polygonal spline sp aces and the numerical solution of the Poisson equation. SIAM J. Numer. Anal. , 54(2):797–824, 2016

2016
[27]

Error estimates for generalized barycentric interpolation

Andrew Gillette, Alexander Rand, and Chandrajit Bajaj. Error estimates for generalized barycentric interpolation. Adv. Comput. Math. , 37(3):417–439, 2012

2012
[28]

Maximum entropy coor dinates for arbitrary polytopes

Kai Hormann and Natarajan Sukumar. Maximum entropy coor dinates for arbitrary polytopes. Comput. Graph. Forum , 27(5):1513–1520, 2008

2008
[29]

Thom´ as Y. S. Hoshina, Ivan F. M. Menezes, and Anderson Pe reira. A simple adaptive mesh reﬁnement scheme for topology optimization using poly gonal meshes. J. Braz. Soc. Mech. Sci. Eng. , 40(7):348, 2018

2018
[30]

Harmonic coordinates for character articulation

Pushkar Joshi, Mark Meyer, Tony DeRose, Brian Green, and Tom Sanocki. Harmonic coordinates for character articulation. In ACM SIGGRAPH 2007 Papers , pages 71:1– 71:9, New York, 2007. ACM

2007
[31]

On recursive reﬁnement o f convex polygons

Ming-Jun Lai and George Slavov. On recursive reﬁnement o f convex polygons. Comput. Aided Geom. Design , 45:83–90, 2016

2016
[32]

A posteriori error estim ates for the weak Galerkin ﬁnite element methods on polytopal meshes

Hengguang Li, Lin Mu, and Xiu Ye. A posteriori error estim ates for the weak Galerkin ﬁnite element methods on polytopal meshes. Commun. Comput. Phys. , 26(2):558–578, 2019. AFEM Based on GBC 23

2019
[33]

Global superconvergence of the lowest-order mixed ﬁnite element on mildly structured meshes

Yu-W en Li. Global superconvergence of the lowest-order mixed ﬁnite element on mildly structured meshes. SIAM J. Numer. Anal. , 56(2):792–815, 2018

2018
[34]

Recovery-based a posteriori error analysis fo r plate bending problems

Yuwen Li. Recovery-based a posteriori error analysis fo r plate bending problems. J. Sci. Comput. , 88(3):Paper No. 77, 26, 2021

2021
[35]

Some p-robust a posteriori error estimates bas ed on auxiliary spaces

Yuwen Li. Some p-robust a posteriori error estimates bas ed on auxiliary spaces. arXiv preprint, arXiv:2511.06603, 2025

work page arXiv 2025
[36]

Smoother-type a posteriori error e stimates for ﬁnite element methods

Yuwen Li and Han Shui. Smoother-type a posteriori error e stimates for ﬁnite element methods. Comput. Methods Appl. Mech. Engrg. , 453:Paper No. 118847, 21, 2026

2026
[37]

A posteriori error estima tes of ﬁnite element methods by preconditioning

Yuwen Li and Ludmil Zikatanov. A posteriori error estima tes of ﬁnite element methods by preconditioning. Comput. Math. Appl. , 91:192–201, 2021

2021
[38]

Nodal auxiliary a posteri ori error estimates

Yuwen Li and Ludmil Zikatanov. Nodal auxiliary a posteri ori error estimates. Math. Comp., 2025, DOI: 10.1090/mcom/4141

work page doi:10.1090/mcom/4141 2025
[39]

Loop and Tony D

Charles T. Loop and Tony D. DeRose. A multisided generali zation of B´ ezier surfaces. ACM Trans. Graph. , 8(3):204–234, 1989

1989
[40]

Interpolati ons for temperature distri- butions: A method for all non-concave polygons

Elisabeth Anna Malsch and Gautam Dasgupta. Interpolati ons for temperature distri- butions: A method for all non-concave polygons. Int. J. Solids Struct. , 41(8):2165–2188, 2004

2004
[41]

Generalized barycentric coordinates on irregular polygons

Mark Meyer, Alan Barr, Haeyoung Lee, and Mathieu Desbrun . Generalized barycentric coordinates on irregular polygons. J. Graph. Tools , 7(1):13–22, 2002

2002
[42]

Nguyen-Xuan

H. Nguyen-Xuan. A polytree-based adaptive polygonal ﬁn ite element method for topol- ogy optimization. Internat. J. Numer. Methods Engrg. , 110(10):972–1000, 2017

2017
[43]

A posteriori error anal ysis of hybrid high-order methods for the elliptic obstacle problem

Kamana Porwal and Ritesh Singla. A posteriori error anal ysis of hybrid high-order methods for the elliptic obstacle problem. J. Sci. Comput. , 102(1):15, 2025

2025
[44]

Spring, Soﬁe E

Daniel W. Spring, Soﬁe E. Leon, and Glaucio H. Paulino. Un structured polygonal meshes with adaptive reﬁnement for the numerical simulatio n of dynamic cohesive frac- ture. Int. J. Fract. , 189:33–57, 2014

2014
[45]

Upper bounds of higher-ord er derivatives for W achs- press coordinates on polytopes

Pengjie Tian and Yanqiu W ang. Upper bounds of higher-ord er derivatives for W achs- press coordinates on polytopes. IMA J. Numer. Anal. , page draf063, 2025

2025
[46]

A posteriori error estimates for ﬁn ite element discretizations of the heat equation

R¨ udiger Verf¨ urth. A posteriori error estimates for ﬁn ite element discretizations of the heat equation. Calcolo, 40(3):195–212, 2003

2003
[47]

W achspress

Eugene L. W achspress. A rational ﬁnite element basis , volume Vol. 114 of Mathematics in Science and Engineering . Academic Press, Inc. [Harcourt Brace Jovanovich, Pub- lishers], New York-London, 1975

1975
[48]

A weak Galerkin mixed ﬁnite eleme nt method for second order elliptic problems

Junping W ang and Xiu Ye. A weak Galerkin mixed ﬁnite eleme nt method for second order elliptic problems. Math. Comp. , 83(289):2101–2126, 2014

2014
[49]

Adaptive virtual element m ethod for optimal control problem governed by general elliptic equation

Qiming W ang and Zhaojie Zhou. Adaptive virtual element m ethod for optimal control problem governed by general elliptic equation. J. Sci. Comput. , 88(1):14, 2021

2021
[50]

Barycentric coordinates for convex polytop es

Joe W arren. Barycentric coordinates for convex polytop es. Adv. Comput. Math. , 6(1):97–108, 1996

1996
[51]

W arren, Scott Schaefer, Anil N

Joe D. W arren, Scott Schaefer, Anil N. Hirani, and Mathie u Desbrun. Barycentric coordinates for convex sets. Adv. Comput. Math. , 27(3):319–338, 2007

2007
[52]

Biharmonic co ordinates

Oﬁr W eber, Roi Poranne, and Craig Gotsman. Biharmonic co ordinates. Comput. Graph. Forum, 31(8):2409–2422, 2012

2012
[53]

A new ﬁnite element gradient recovery method: su- perconvergence property

Zhimin Zhang and Ahmed Naga. A new ﬁnite element gradient recovery method: su- perconvergence property. SIAM J. Sci. Comput. , 26(4):1192–1213, 2005

2005
[54]

The superc onvergent patch recovery and a posteriori error estimates

Olgierd Cecil Zienkiewicz and Jianzhong Zhu. The superc onvergent patch recovery and a posteriori error estimates. part ii. error estimates and a daptivity. Internat. J. Numer. Methods Engrg., 33(7):1365–1382, 1992

1992