arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1707.09598math.NAcs.NA
收藏

一种稀疏网格同构求解器

A sparse-grid isogeometric solver

King Abdullah University of Science and Technology (KAUST)(阿卜杜拉国王科技大学);Università di Pavia(帕维亚大学);Consiglio Nazionale delle Ricerche - Istituto di Matematica Applicata e Tecnologie Informatiche “E. Magenes” (CNR-IMATI)(国家研究委员会-应用数学与信息技术研究所“E.马热内斯”)

Joakim Beck, Giancarlo Sangalli, Lorenzo Tamellini

AI总结:

本文研究了稀疏网格构造在同构分析求解器中的应用,证明在解足够光滑时有效,并在非光滑解情况下通过非等距网格提升性能,同时指出稀疏网格可简化并行化现有串行求解器。

摘要:

同构分析(IGA)通常采用张量积样条和NURBS作为PDE解的近似基函数。本文探讨了稀疏网格构造在IGA组合技术中的应用潜力,该构造最初用于高维PDE近似。测试表明,当PDE解足够光滑时,稀疏网格确实有效。在非光滑解情况下,若能利用解奇异性位置的先验知识,可设计合适的非等距网格。最后指出,稀疏网格可作为简单方法,将现有串行IGA求解器并行化,这对许多实际应用有帮助。

英文摘要:

Isogeometric Analysis (IGA) typically adopts tensor-product splines and NURBS as a basis for the approximation of the solution of PDEs. In this work, we investigate to which extent IGA solvers can benefit from the so-called sparse-grids construction in its combination technique form, which was first introduced in the early 90s in the context of the approximation of high-dimensional PDEs. The tests that we report show that, in accordance to the literature, a sparse-grid construction can indeed be useful if the solution of the PDE at hand is sufficiently smooth. Sparse grids can also be useful in the case of non-smooth solutions when some a-priori knowledge on the location of the singularities of the solution can be exploited to devise suitable non-equispaced meshes. Finally, we remark that sparse grids can be seen as a simple way to parallelize pre-existing serial IGA solvers in a straightforward fashion, which can be beneficial in many practical situations.

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

↑