{"title":"Approximation properties over self-similar meshes of curved finite elements and applications to subdivision based isogeometric analysis","authors":"Thomas Takacs","doi":"10.1016/j.cagd.2025.102413","DOIUrl":null,"url":null,"abstract":"<div><div>In this study we consider domains that are composed of an infinite sequence of self-similar rings and corresponding finite element spaces over those domains. The rings are parameterized using piecewise polynomial or tensor-product B-spline mappings of degree <em>q</em> over quadrilateral meshes. We then consider finite element discretizations which, over each ring, are mapped, piecewise polynomial functions of degree <em>p</em>. Such domains that are composed of self-similar rings may be created through a subdivision scheme or from a scaled boundary parameterization.</div><div>We study approximation properties over such recursively parameterized domains. The main finding is that, for generic isoparametric discretizations (i.e., where <span><math><mi>p</mi><mo>=</mo><mi>q</mi></math></span>), the approximation properties always depend only on the degree of polynomials that can be reproduced exactly in the physical domain and not on the degree <em>p</em> of the mapped elements. Especially, in general, <span><math><msup><mrow><mi>L</mi></mrow><mrow><mo>∞</mo></mrow></msup></math></span>-errors converge at most with the rate <span><math><msup><mrow><mi>h</mi></mrow><mrow><mn>2</mn></mrow></msup></math></span>, where <em>h</em> is the mesh size, independent of the degree <span><math><mi>p</mi><mo>=</mo><mi>q</mi></math></span>. This has implications for subdivision based isogeometric analysis, which we will discuss in this paper.</div></div>","PeriodicalId":55226,"journal":{"name":"Computer Aided Geometric Design","volume":"116 ","pages":"Article 102413"},"PeriodicalIF":1.3000,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computer Aided Geometric Design","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0167839625000020","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, SOFTWARE ENGINEERING","Score":null,"Total":0}
引用次数: 0
Abstract
In this study we consider domains that are composed of an infinite sequence of self-similar rings and corresponding finite element spaces over those domains. The rings are parameterized using piecewise polynomial or tensor-product B-spline mappings of degree q over quadrilateral meshes. We then consider finite element discretizations which, over each ring, are mapped, piecewise polynomial functions of degree p. Such domains that are composed of self-similar rings may be created through a subdivision scheme or from a scaled boundary parameterization.
We study approximation properties over such recursively parameterized domains. The main finding is that, for generic isoparametric discretizations (i.e., where ), the approximation properties always depend only on the degree of polynomials that can be reproduced exactly in the physical domain and not on the degree p of the mapped elements. Especially, in general, -errors converge at most with the rate , where h is the mesh size, independent of the degree . This has implications for subdivision based isogeometric analysis, which we will discuss in this paper.
期刊介绍:
The journal Computer Aided Geometric Design is for researchers, scholars, and software developers dealing with mathematical and computational methods for the description of geometric objects as they arise in areas ranging from CAD/CAM to robotics and scientific visualization. The journal publishes original research papers, survey papers and with quick editorial decisions short communications of at most 3 pages. The primary objects of interest are curves, surfaces, and volumes such as splines (NURBS), meshes, subdivision surfaces as well as algorithms to generate, analyze, and manipulate them. This journal will report on new developments in CAGD and its applications, including but not restricted to the following:
-Mathematical and Geometric Foundations-
Curve, Surface, and Volume generation-
CAGD applications in Numerical Analysis, Computational Geometry, Computer Graphics, or Computer Vision-
Industrial, medical, and scientific applications.
The aim is to collect and disseminate information on computer aided design in one journal. To provide the user community with methods and algorithms for representing curves and surfaces. To illustrate computer aided geometric design by means of interesting applications. To combine curve and surface methods with computer graphics. To explain scientific phenomena by means of computer graphics. To concentrate on the interaction between theory and application. To expose unsolved problems of the practice. To develop new methods in computer aided geometry.