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

空间相关源反问题的直接时间离散拟边值方法

A Direct Parallel-in-Time Quasi-Boundary Value Method for Inverse Space-Dependent Source Problems

Yi Jiang, Jun Liu, Xiang-Sheng Wang

摘要:

反源问题经常出现在实际应用中,如定位未知的地下水污染源。与Tikhonov正则化方法不同,拟边值方法被认为是一种有效的正则化方法,在适当的假设条件下,该方法具有最优阶收敛速度.然而,快速直接或迭代求解所产生的所有一次大规模线性系一直很少在文献中研究。在这项工作中,我们首先提出并分析了一个修改的准边值方法,然后开发了一个基于对角化的并行时间(PinT)直接求解器,它可以实现显着的加速比的CPU时间相比,MATLAB的稀疏直接求解器。特别地,时间离散矩阵$B$被证明是可对角化的,并且其特征向量矩阵$V$的条件数被证明呈现二次增长,这保证了由于对角化引起的循环误差被很好地控制。几个一维和二维的例子来证明我们所提出的方法,在2D的情况下,CPU时间可以加快三个数量级的非常有前途的计算效率。

英文摘要:

Inverse source problems arise often in real-world applications, such as localizing unknown groundwater contaminant sources. Being different from Tikhonov regularization, the quasi-boundary value method has been proposed and analyzed as an effective way for regularizing such inverse source problems, which was shown to achieve an optimal order convergence rate under suitable assumptions. However, fast direct or iterative solvers for the resulting all-at-once large-scale linear systems have been rarely studied in the literature. In this work, we first proposed and analyzed a modified quasi-boundary value method, and then developed a diagonalization-based parallel-in-time (PinT) direct solver, which can achieve a dramatic speedup in CPU times when compared with MATLAB's sparse direct solver. In particular, the time-discretization matrix $B$ is shown to be diagonalizable, and the condition number of its eigenvector matrix $V$ is proven to exhibit quadratic growth, which guarantees the roundoff errors due to diagonalization is well controlled. Several 1D and 2D examples are presented to demonstrate the very promising computational efficiency of our proposed method, where the CPU times in 2D cases can be speedup by three orders of magnitude.

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

↑