arXiv Analytics

Sign in

arXiv:1509.07016 [math.NA]AbstractReferencesReviewsResources

Mesh Grading in Isogeometric Analysis

Ulrich Langer, Angelos Mantzaflaris, Stephen E. Moore, Ioannis Toulopoulos

Published 2015-09-23Version 1

This paper is concerned with the construction of graded meshes for approximating so-called singular solutions of elliptic boundary value problems by means of multipatch discontinuous Galerkin Isogeometric Analysis schemes. Such solutions appear, for instance, in domains with re-entrant corners on the boundary of the computational domain, in problems with changing boundary conditions, in interface problems, or in problems with singular source terms. Making use of the analytic behavior of the solution, we construct the graded meshes in the neighborhoods of such singular points following a multipatch approach. We prove that appropriately graded meshes lead to the same convergence rates as in the case of smooth solutions with approximately the same number of degrees of freedom. Representative numerical examples are studied in order to confirm the theoretical convergence rates and to demonstrate the efficiency of the mesh grading technology in Isogeometric Analysis.

Related articles: Most relevant | Search more
arXiv:1802.05904 [math.NA] (Published 2018-02-16)
Optimal error estimates of least-squares variational kernel-based methods for second-order PDEs
arXiv:1408.0182 [math.NA] (Published 2014-08-01)
Analysis of Multipatch Discontinuous Galerkin IgA Approximations to Elliptic Boundary Value Problems
arXiv:1812.08568 [math.NA] (Published 2018-12-20)
Graded Parametric CutFEM and CutIGA for Elliptic Boundary Value Problems in Domains with Corners