Coupled multi-physics problems are encountered in countless applications and pose significant numerical challenges. Although monolithic approaches offer possibly the best solution strategy, they often require ad-hoc preconditioners and numerical implementations. Sequential (also known as splitted, partitioned or segregated) approaches are iterative methods for solving coupled problems where each equation is solved independently and the coupling is achieved through iterations. These methods offer the possibility to flexibly add or remove equations from a model and to rely on existing black-box solvers for every specific equation. Furthermore, when problems are non-linear, inner iterations need to be performed even in monolithic solvers, therefore making a sequential iterative approach a viable alternative. The cost of running inner iterations to achieve the coupling, however, could easily becomes prohibitive, or, in some cases the iterations might not converge. In this work we present a general formulation of splitting schemes for continuous operators, with arbitrary implicit/explicit splitting, like in standard iterative methods for linear systems. By introducing a generic relaxation operator we find the conditions for the convergence of the iterative schemes. We show how the relaxation operator can be thought as a preconditioner and constructed based on an approximate Schur-complement. We propose a Schur-based Partial Jacobi relaxation operator to stabilise the coupling and show its effectiveness. Although we mainly focus on scalar-scalar linear problems, most results are easily extended to non-linear and higher-dimensional problems. Numerical tests (1D and 2D) for two PDE systems, namely the Dual-Porosity model and a Quad-Laplacian operator, are carried out to confirm the theoretical results.
翻译:在无数的应用中遇到多种多物理问题,并提出了巨大的数字挑战。尽管单理方法提供了可能的最佳解决方案战略,但它们往往需要特别的前提条件和数字执行。顺序方法(又称分裂、分割或分离)是迭代方法,用来解决同时的问题,每个方程式都是独立解决的,并且通过迭代实现联结。在这项工作中,我们提出了一个关于连续操作者分解计划的一般提法,其任意的隐含/清晰的分解,如线性系统的标准迭接方法。在非线性情况下,内部迭代方法需要甚至以单理式的更高解答器进行,因此,使顺序迭代方法成为可行的替代方法。然而,运行内部迭代方法的成本很容易变得令人望而异,或者在某些情况下,迭代方法可能不会通过迭代而趋同。我们提出了一个关于连续操作者分解计划的一般提法,其任意的隐含/清晰的分解方法,如线性平流系统的标准迭代方法。通过引入一个通用的放松操作者,我们发现迭代办法的趋近了迭代方法的不伸缩条件,因此,连续的迭代方法就是不断的迭代方法的迭代方法的迭代方法。我们展示了一次的缩操作操作者们的渐渐渐渐渐渐变的平的平的平的平的平基的变结果。