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

基于快速求解Sylvester方程的等几何预条件子

Isogeometric preconditioners based on fast solvers for the Sylvester equation

Università di Pavia(帕维亚大学)

Giancarlo Sangalli, Mattia Tani

AI总结:

本文提出基于快速求解Sylvester方程的等几何预条件子,用于解决单域泊松问题的大型线性系统,展现其在高阶样条基函数下的鲁棒性及高效性。

摘要:

我们考虑了源自单域泊松问题等几何离散化的大规模线性系统。数值求解此类系统是一项具有挑战性的任务,尤其当所用样条基函数的阶数较高时。我们考虑了一种基于迭代求解器每一步中求解Sylvester-like方程的预条件策略。我们展示该策略充分利用了等几何问题下的张量结构,对网格尺寸和样条阶数具有鲁棒性,尽管可能受到复杂几何或系数的影响。我们考虑了两种流行的Sylvester方程求解器,直接和迭代求解器,并详细讨论了它们在二维和三维单域或多域NURBS几何上的实现和效率。不同域几何问题的数值实验展示了该方法的潜力。

英文摘要:

We consider large linear systems arising from the isogeometric discretization of the Poisson problem on a single-patch domain. The numerical solution of such systems is considered a challenging task, particularly when the degree of the splines employed as basis functions is high. We consider a preconditioning strategy which is based on the solution of a Sylvester-like equation at each step of an iterative solver. We show that this strategy, which fully exploits the tensor structure that underlies isogeometric problems, is robust with respect to both mesh size and spline degree, although it may suffer from the presence of complicated geometry or coefficients. We consider two popular solvers for the Sylvester equation, a direct one and an iterative one, and we discuss in detail their implementation and efficiency for 2D and 3D problems on single-patch or conforming multi-patch NURBS geometries. Numerical experiments for problems with different domain geometries are presented, which demonstrate the potential of this approach.

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

↑