Approximation properties over self-similar meshes of curved finite elements and applications to subdivision based isogeometric analysis

IF 1.7 4区 计算机科学 Q3 COMPUTER SCIENCE, SOFTWARE ENGINEERING Computer Aided Geometric Design Pub Date : 2025-02-01 Epub Date: 2025-02-10 DOI:10.1016/j.cagd.2025.102413
Thomas Takacs
{"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.7000,"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":"2025/2/10 0:00:00","PubModel":"Epub","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 p=q), 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, L-errors converge at most with the rate h2, where h is the mesh size, independent of the degree p=q. This has implications for subdivision based isogeometric analysis, which we will discuss in this paper.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
曲面有限元自相似网格的近似性质及其在细分等几何分析中的应用
在本研究中,我们考虑由自相似环的无限序列和相应的有限元空间在这些域上组成的域。使用四边形网格上的分段多项式或张量-积b样条映射来参数化环。然后,我们考虑在每个环上映射的有限元离散化,p次的分段多项式函数。这些由自相似环组成的域可以通过细分方案或缩放边界参数化来创建。我们研究了这种递归参数化域上的近似性质。主要发现是,对于一般的等参离散化(即,p=q),近似性质总是只依赖于可以在物理域中精确再现的多项式的程度,而不依赖于映射元素的程度p。特别是,一般情况下,L∞误差最收敛于速率h2,其中h为网格大小,与度p=q无关。这对基于等几何分析的细分有影响,我们将在本文中讨论。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Computer Aided Geometric Design
Computer Aided Geometric Design 工程技术-计算机:软件工程
CiteScore
3.50
自引率
13.30%
发文量
57
审稿时长
60 days
期刊介绍: 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.
期刊最新文献
Computer-aided design of lacunar fractal polygons A geometric characterisation of PH-cubics via the focus of the cusp curve Editorial Board UVConv: A UV grid-based convolutional neural network for classification and segmentation of 3D CAD models Transferable and undefendable point cloud attacks via medial axis transform
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1