arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2204.10000math.NAcs.NA
收藏

平面多块域上基于$C^1$(截断)层次样条的自适应等几何方法

Adaptive isogeometric methods with $C^1$ (truncated) hierarchical splines on planar multi-patch domains

Cesare Bracco, Carlotta Giannelli, Mario Kapl, Rafael Vázquez

摘要:

等几何分析是利用样条函数的高光滑性求解高阶偏微分方程的一种有效方法。然而,标准的多元B样条模型的张量积结构是不太适合复杂的几何形状的表示,并保持高连续性的一般域上的特殊结构的多补丁的几何形状必须使用。本文主要研究了基于层次样条的自适应等几何方法,并将多块平面域上的$C^1$等几何样条空间的构造推广到层次情形。我们引入了一个新的抽象框架的层次样条的定义,它取代了假设的局部线性独立的基础上的每一个层次的一个较弱的假设。我们还开发了一个细化算法,保证满足的假设是由$C^1$样条在某些适当的分级层次多补丁网格配置,并证明它具有线性复杂性。通过求解Poisson和双调和问题来检验自适应方法的性能。

英文摘要:

Isogeometric analysis is a powerful paradigm which exploits the high smoothness of splines for the numerical solution of high order partial differential equations. However, the tensor-product structure of standard multivariate B-spline models is not well suited for the representation of complex geometries, and to maintain high continuity on general domains special constructions on multi-patch geometries must be used. In this paper we focus on adaptive isogeometric methods with hierarchical splines, and extend the construction of $C^1$ isogeometric spline spaces on multi-patch planar domains to the hierarchical setting. We introduce a new abstract framework for the definition of hierarchical splines, which replaces the hypothesis of local linear independence for the basis of each level by a weaker assumption. We also develop a refinement algorithm that guarantees that the assumption is fulfilled by $C^1$ splines on certain suitably graded hierarchical multi-patch mesh configurations, and prove that it has linear complexity. The performance of the adaptive method is tested by solving the Poisson and the biharmonic problems.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑