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

一种自适应高阶直接求解技术用于椭圆边值问题

An adaptive high order direct solution technique for elliptic boundary value problems

Rice University(莱斯大学)

Peter Geldermans, Adrianna Gillman

AI总结:

本文提出了一种自适应高阶离散化技术,用于解决椭圆边值问题,改进了Hierarchical Poincaré-Steklov方法,通过更高效的张量积基底实现自适应细化,提高求解精度和效率。

摘要:

本文提出了用于椭圆边值问题的自适应高阶离散化技术。该技术应用于Hierarchical Poincaré-Steklov(HPS)方法的更新版本。HPS方法基于局部伪谱离散化,通过Poincaré-Steklov算子连接。新版本使用改进的张量积基底,比以前版本更高效且稳定。自适应技术利用基函数的张量积性质,创建判断域中哪些部分需要进一步细化的标准。所得离散化达到用户指定的精度,并附带高效的直接求解器。直接求解器扩大了应用范围,适用于时间依赖问题,因为以前椭圆问题的求解成本限制了隐式时间步进方案的使用。

英文摘要:

This manuscript presents an adaptive high order discretization technique for elliptic boundary value problems. The technique is applied to an updated version of the Hierarchical Poincaré-Steklov (HPS) method. Roughly speaking, the HPS method is based on local pseudospectral discretizations glued together with Poincaré-Steklov operators. The new version uses a modified tensor product basis which is more efficient and stable than previous versions. The adaptive technique exploits the tensor product nature of the basis functions to create a criterion for determining which parts of the domain require additional refinement. The resulting discretization achieves the user prescribed accuracy and comes with an efficient direct solver. The direct solver increases the range of applicability to time dependent problems where the cost of solving elliptic problems previously limited the use of implicit time stepping schemes.

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

↑