Discretization of Non-uniform Rational B-Spline (NURBS) Models for Meshless Isogeometric Analysis

IF 2.8 2区 数学 Q1 MATHEMATICS, APPLIED Journal of Scientific Computing Pub Date : 2024-07-02 DOI:10.1007/s10915-024-02597-z
Urban Duh, Varun Shankar, Gregor Kosec
{"title":"Discretization of Non-uniform Rational B-Spline (NURBS) Models for Meshless Isogeometric Analysis","authors":"Urban Duh, Varun Shankar, Gregor Kosec","doi":"10.1007/s10915-024-02597-z","DOIUrl":null,"url":null,"abstract":"<p>We present an algorithm for fast generation of quasi-uniform and variable-spacing nodes on domains whose boundaries are represented as computer-aided design (CAD) models, more specifically non-uniform rational B-splines (NURBS). This new algorithm enables the solution of partial differential equations within the volumes enclosed by these CAD models using (collocation-based) meshless numerical discretizations. Our hierarchical algorithm first generates quasi-uniform node sets directly on the NURBS surfaces representing the domain boundary, then uses the NURBS representation in conjunction with the surface nodes to generate nodes within the volume enclosed by the NURBS surface. We provide evidence for the quality of these node sets by analyzing them in terms of local regularity and separation distances. Finally, we demonstrate that these node sets are well-suited (both in terms of accuracy and numerical stability) for meshless radial basis function generated finite differences discretizations of the Poisson, Navier-Cauchy, and heat equations. Our algorithm constitutes an important step in bridging the field of node generation for meshless discretizations with isogeometric analysis.</p>","PeriodicalId":50055,"journal":{"name":"Journal of Scientific Computing","volume":"28 1","pages":""},"PeriodicalIF":2.8000,"publicationDate":"2024-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Scientific Computing","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1007/s10915-024-02597-z","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 0

Abstract

We present an algorithm for fast generation of quasi-uniform and variable-spacing nodes on domains whose boundaries are represented as computer-aided design (CAD) models, more specifically non-uniform rational B-splines (NURBS). This new algorithm enables the solution of partial differential equations within the volumes enclosed by these CAD models using (collocation-based) meshless numerical discretizations. Our hierarchical algorithm first generates quasi-uniform node sets directly on the NURBS surfaces representing the domain boundary, then uses the NURBS representation in conjunction with the surface nodes to generate nodes within the volume enclosed by the NURBS surface. We provide evidence for the quality of these node sets by analyzing them in terms of local regularity and separation distances. Finally, we demonstrate that these node sets are well-suited (both in terms of accuracy and numerical stability) for meshless radial basis function generated finite differences discretizations of the Poisson, Navier-Cauchy, and heat equations. Our algorithm constitutes an important step in bridging the field of node generation for meshless discretizations with isogeometric analysis.

Abstract Image

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
非均匀有理 B-样条线 (NURBS) 模型的离散化,用于无网格等距分析
我们提出了一种在边界以计算机辅助设计(CAD)模型(更具体地说是非均匀有理 B-样条曲线(NURBS))表示的域上快速生成准均匀和可变间距节点的算法。利用这种新算法,可以使用(基于配位的)无网格数值离散法求解这些 CAD 模型所包围体积内的偏微分方程。我们的分层算法首先在代表域边界的 NURBS 表面上直接生成准均匀节点集,然后结合表面节点使用 NURBS 表示法在 NURBS 表面所包围的体积内生成节点。我们通过分析这些节点集的局部规则性和分离距离,为其质量提供了证据。最后,我们证明了这些节点集非常适合于对泊松方程、纳维-考奇方程和热方程进行无网格径向基函数有限差分离散化(在精度和数值稳定性方面)。我们的算法是连接无网格离散化节点生成与等时几何分析领域的重要一步。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Journal of Scientific Computing
Journal of Scientific Computing 数学-应用数学
CiteScore
4.00
自引率
12.00%
发文量
302
审稿时长
4-8 weeks
期刊介绍: Journal of Scientific Computing is an international interdisciplinary forum for the publication of papers on state-of-the-art developments in scientific computing and its applications in science and engineering. The journal publishes high-quality, peer-reviewed original papers, review papers and short communications on scientific computing.
期刊最新文献
Nonlinear Hierarchical Matrix Factorization-Based Tensor Ring Approximation for Multi-dimensional Image Recovery Fully Discrete Finite Difference Schemes for the Fractional Korteweg-de Vries Equation Curvature-Dependent Elastic Bending Total Variation Model for Image Inpainting with the SAV Algorithm The Optimal Weights of Non-local Means for Variance Stabilized Noise Removal An HDG and CG Method for the Indefinite Time-Harmonic Maxwell’s Equations Under Minimal Regularity
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1