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

使用时空区域分解求解非线性多相流问题的序贯细化求解器

Sequential Refinement Solver using Space-Time Domain Decomposition for Non-linear Multiphase Flow Problems

Hanyu Li, Mary F. Wheeler

AI总结:

针对非线性方程组数值求解的收敛失败与计算量大问题,提出一种基于非线性两相流模型的时空域序贯局部细化方案,在保证精度的同时防止收敛失败并实现5倍加速。

摘要:

收敛失败和收敛速度慢是数值求解非线性方程组面临的最大挑战之一。虽然使用严格的小时间步长和无条件稳定的全隐式方案可以缓解该问题,但计算负荷变得极其庞大。我们引入了一种时空域的序贯局部细化方案,它在不限制为小时间步长的情况下提高了收敛速度并防止了收敛失败,从而提升了计算效率。我们依赖于非线性两相流模型。该算法首先求解最粗网格。然后,将具有特定特征的区域(如饱和度前沿)依次细化至最高分辨率。这一过程防止了收敛失败。在每次细化后,使用来自前一网格的解来估计当前网格的初始猜测值,以实现更快的收敛。给出了数值结果以确认我们的算法相较于传统小时间步长方法的准确性。我们还观察到,使用我们的算法使运行时间加速了5倍。

英文摘要:

Convergence failure and slow convergence rate are among the biggest challenges with solving the system of non-linear equations numerically. While using strictly small time steps sizes and unconditionally stable fully implicit scheme mitigate the problem, the computational load becomes enormous. We introduce a sequential local refinement scheme in space-time domain that improves convergence rate and prevents convergence failure while not restricting to small time step, thus boosting computational efficiency. We rely on the non-linear two-phase flow model. The algorithm starts by solving the coarsest mesh. Then regions with certain features such as saturation front is refined to the finest resolution sequentially. Such process prevents convergence failure. After each refinement, the solution from the previous mesh is used to estimate initial guess of the current mesh for faster convergence. Numerical results are presented to confirm accuracy of our algorithm as compared to the traditional fine time step approach. We also observe 5 times speedup in the runtime by using our algorithm.

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

↑