We address numerical solvers for a poromechanics model particularly adapted for soft materials, as it generally respects thermodynamics principles and energy balance. Considering the multi-physics nature of the problem, which involves solid and fluid species, interacting on the basis of mass balance and momentum conservation, we decide to adopt a solution strategy of the discrete problem based on iterative splitting schemes. As the model is similar (but not equivalent to) the Biot poromechanics problem, we follow the abundant literature for solvers of the latter equations, developing two approaches that resemble the well known undrained and fixed-stress splits for the Biot model. A thorough convergence analysis of the proposed schemes is performed. In particular, the undrained-like split is developed and analyzed in the framework of generalized gradient flows, whereas the fixed-stress-like split is understood as block-diagonal $L^2$-type stabilization and analyzed by means of a relative stability analysis. In addition, the application of Anderson acceleration is suggested, improving the robustness of the split schemes. Finally, we test these methods on different benchmark tests, and we also compare their performance with respect to a monolithic approach. Together with the theoretical analysis, the numerical examples provide guidelines to appropriately choose what split scheme shall be used to address realistic applications of the soft material poromechanics model.
Adaptive asynchronous time-stepping, stopping criteria, and a posteriori error estimates for fixed-stress iterative schemes for coupled poromechanics problems
This work serves as a primer to our efforts in arriving at convergence estimates for the fixed stress split iterative scheme for single phase flow coupled with small strain anisotropic poroelastoplasticity. The fixed stress split iterative scheme solves the flow subproblem with stress tensor fixed using a mixed finite element method, followed by the poromechanics subproblem using a conforming Galerkin method in every coupling iteration at each time step. The coupling iterations are repeated until convergence and Backward Euler is employed for time marching. The convergence analysis is based on…
We present a loosely coupled, non-iterative time-splitting scheme based on Robin-Robin coupling conditions. We apply a novel unified analysis for this scheme applied to both a Parabolic/Parabolic coupled system and a Parabolic/Hyperbolic coupled system. We show for both systems that the scheme is stable, and the error converges as $\mathcal{O}\big(Δt \sqrt{T +\log{\frac{1}{Δt}}}\big)$, where $Δt$ is the time step
In this paper, the concept of matrix splitting is introduced to solve a large sparse ill-posed linear system via Tikhonov's regularization. In the regularization process, we convert the ill-posed system to a well-posed system. The convergence of such a well-posed system is discussed by using different types of matrix splittings. Comparison analysis of both systems are studied by operating certain types of weak splittings. Further, we have extended the double splitting of [Song J and Song Y, Calcolo 48(3), 245-260, 2011] to double weak splitting of type II for nonsingular symmetric matrices. In…
In this paper we present iterative and noniterative splitting methods, which are used to solve stochastic Burgers' equations. The non-iterative splitting methods are based on Lie-Trotter and Strang-splitting methods, while the iterative splitting approaches are based on the exponential integrators for stochastic differential equations. Based on the nonlinearity of the Burgers' equation, we have investigated that the iterative schemes are more accurate and efficient as the non-iterative methods.
Schwarz Iterative Methods: Infinite Space Splittings
Institute for Numerical Simulation, Universität Bonn（波恩大学数值模拟研究所）；Fraunhofer Institute for Algorithms and Scientific Computing (SCAI)（弗劳恩霍夫算法与科学计算研究所）；Jacobs University Bremen（不来梅雅各布斯大学）
The indefinite least squares (ILS) problem is a generalization of the famous linear least squares problem. It minimizes an indefinite quadratic form with respect to a signature matrix. For this problem, we first propose an impressively simple and effective splitting (SP) method according to its own structure and prove that it converges 'unconditionally' for any initial value. Further, to avoid implementing some matrix multiplications and calculating the inverse of large matrix and considering the acceleration and efficiency of the randomized strategy, we develop two randomized iterative method…
This paper presents the results of a preliminary experimental investigation of the performance of a stationary iterative method based on a block staircase splitting for solving singular systems of linear equations arising in Markov chain modelling. From the experiments presented, we can deduce that the method is well suited for solving block banded or more generally localized systems in a parallel computing environment. The parallel implementation has been benchmarked using several Markovian models.
The fixed-stress splitting scheme is a popular method for iteratively solving the Biot equations. The method successively solves the flow and mechanic subproblems while adding a stabilizing term to the flow equation, which includes a parameter that can be chosen freely. However, the convergence properties of the scheme depend significantly on this parameter and choosing it carelessly might lead to a very slow, or even diverging, method. In this paper, we present a way to exploit the matrix structure arizing from discretizing the equations in the regime of impermeable porous media in order to o…
In this work we consider the transport of a surfactant in a variably saturated porous media. The water flow is modelled by the Richards equations and it is fully coupled with the transport equation for the surfactant. Three linearization techniques are discussed: the Newton method, the modified Picard and the L-scheme. Based on these, monolithic and splitting schemes are proposed and their convergence is analyzed. The performance of these schemes is illustrated on four numerical examples. For these examples, the number of iterations and the condition numbers of the linear systems emerging in e…
