TY - JOUR
T1 - Recovery-based error estimation and adaptivity using high-order splines over hierarchical T-meshes
AU - Anitescu, Cosmin
AU - Hossain, Md Naim
AU - Rabczuk, Timon
N1 - Funding Information:
The research leading to these results has received funding from the European Research Council under the European Union’s Seventh Framework Programme ( FP7/2007–2013 )/ ERC grant agreement 615132 and from the People Programme (Marie Curie Actions) under Research Executive Agency grant agreement 289361 .
Publisher Copyright:
© 2017 Elsevier B.V.
PY - 2018/1/1
Y1 - 2018/1/1
N2 - An adaptive higher-order method based on a generalization of polynomial/rational splines over hierarchical T-meshes (PHT/RHT-splines) is introduced. While most problems considered in isogeometric analysis can be solved efficiently when the solution is smooth, many non-trivial simulations have rough solutions. This can be caused, for example, by the presence of re-entrant corners in the domain. For such problems, a tensor-product basis is less suitable for resolving the singularities that appear, as refinement propagates throughout the computational domain. Hierarchical bases and adaptivity allow for a more efficient way of dealing with singularities, by adding more degrees of freedom only where they are necessary to improve the approximation. In order to drive the adaptive refinement, an efficient recovery-based error estimator is proposed in this work. The estimator produces a “recovered solution” which is a more accurate approximation than the computed numerical solution. Several 2D and 3D numerical investigations with PHT-splines of higher order and greater continuity show good performance compared to uniform refinement in terms of degrees of freedom and computational cost.
AB - An adaptive higher-order method based on a generalization of polynomial/rational splines over hierarchical T-meshes (PHT/RHT-splines) is introduced. While most problems considered in isogeometric analysis can be solved efficiently when the solution is smooth, many non-trivial simulations have rough solutions. This can be caused, for example, by the presence of re-entrant corners in the domain. For such problems, a tensor-product basis is less suitable for resolving the singularities that appear, as refinement propagates throughout the computational domain. Hierarchical bases and adaptivity allow for a more efficient way of dealing with singularities, by adding more degrees of freedom only where they are necessary to improve the approximation. In order to drive the adaptive refinement, an efficient recovery-based error estimator is proposed in this work. The estimator produces a “recovered solution” which is a more accurate approximation than the computed numerical solution. Several 2D and 3D numerical investigations with PHT-splines of higher order and greater continuity show good performance compared to uniform refinement in terms of degrees of freedom and computational cost.
KW - Error estimation
KW - Hierarchical splines
KW - Isogeometric analysis
KW - Linear elasticity
KW - Superconvergent patch recovery
UR - http://www.scopus.com/inward/record.url?scp=85032879540&partnerID=8YFLogxK
U2 - 10.1016/j.cma.2017.08.032
DO - 10.1016/j.cma.2017.08.032
M3 - Article
AN - SCOPUS:85032879540
SN - 0045-7825
VL - 328
SP - 638
EP - 662
JO - Computer Methods in Applied Mechanics and Engineering
JF - Computer Methods in Applied Mechanics and Engineering
ER -