In this paper we study the linear systems arising from discretized poroelasticity problems. We formulate one block preconditioner for the two-filed Biot model and several preconditioners for the classical three-filed Biot model under the unified relationship framework between well-posedness and preconditioners. By the unified theory, we show all the considered preconditioners are uniformly optimal with respect to material and discretization parameters. Numerical tests demonstrate the robustness of these preconditioners.
Advanced finite-element discretizations and preconditioners for models of poroelasticity have attracted significant attention in recent years. The equations of poroelasticity offer significant challenges in both areas, due to the potentially strong coupling between unknowns in the system, saddle-point structure, and the need to account for wide ranges of parameter values, including limiting behavior such as incompressible elasticity. This paper was motivated by an attempt to develop monolithic multigrid preconditioners for the discretization developed in [48]; we show here why this is a diffic…
The mechanical behaviour of a poroelastic medium permeated by multiple interacting fluid networks can be described by a system of time-dependent partial differential equations known as the multiple-network poroelasticity (MPET) equations or multi-porosity/multi-permeability systems. These equations generalize Biot's equations, which describe the mechanics of the one-network case. The efficient numerical solution of the MPET equations is challenging, in part due to the complexity of the system and in part due to the presence of interacting parameter regimes. In this paper, we present a new stra…
In this work, we consider a hybrid mixed finite element method for Biot's model. The hybrid P1-RT0-P0 discretization of the displacement-pressure-Darcy's velocity system of Biot's model presented in \cite{C. Niu} is not uniformly stable with respect to the physical parameters, resulting in some issues in numerical simulations. To alleviate such problems, following \cite{V. Girault}, we stabilize the hybrid scheme with face bubble functions and show the well-posedness with respect to physical and discretization parameters, which provide optimal error estimates of the stabilized method. We intro…
This work proposes a mixed finite element method for the Biot poroelasticity equations that employs the lowest-order Raviart-Thomas finite element space for the solid displacement and piecewise constants for the fluid pressure. The method is based on the formulation of linearized elasticity as a weighted vector Laplace problem. By introducing the solid rotation and fluid flux as auxiliary variables, we form a four-field formulation of the Biot system, which is discretized using conforming mixed finite element spaces. The auxiliary variables are subsequently removed from the system in a local h…
Parameter-free inexact block Schur complement preconditioning for linear poroelasticity under a hybrid Bernardi-Raugel and weak Galerkin finite element discretization
The quasi-static multiple network poroelastic theory (MPET) model, first introduced in the context of geomechanics, has recently found new applications in medicine. In practice, the parameters in the MPET equations can vary over several orders of magnitude which makes their stable discretization and fast solution a challenging task. Here, a new efficient parameter-robust hybridized discontinuous Galerkin method, which also features fluid mass conservation, is proposed for the MPET model. Its stability analysis which is crucial for the well-posedness of the discrete problem is performed and cos…
We develop robust solvers for a class of perturbed saddle-point problems arising in the study of a second-order elliptic equation in mixed form (in terms of flux and potential), and of the four-field formulation of Biot's consolidation problem for linear poroelasticity (using displacement, filtration flux, total pressure and fluid pressure). The stability of the continuous variational mixed problems, which hinges upon using adequately weighted spaces, is addressed in detail; and the efficacy of the proposed preconditioners, as well as their robustness with respect to relevant material properti…
The classical Biot's theory provides the foundation of a fully dynamic poroelasticity model describing the propagation of elastic waves in fluid-saturated media. Multiple network poroelastic theory (MPET) takes into account that the elastic matrix (solid) can be permeated by one or several ($n\ge1$) superimposed interacting single fluid networks of possibly different characteristics; hence the single network (classical Biot) model can be considered as a special case of the MPET model. We analyze the stability properties of the time-discrete systems arising from second-order implicit time stepp…
This work is concerned with the iterative solution of systems of quasi-static multiple-network poroelasticity (MPET) equations describing flow in elastic porous media that is permeated by single or multiple fluid networks. Here, the focus is on a three-field formulation of the problem in which the displacement field of the elastic matrix and, additionally, one velocity field and one pressure field for each of the $n \ge 1$ fluid networks are the unknown physical quantities. Generalizing Biot's model of consolidation, which is obtained for $n=1$, the MPET equations for $n\ge1$ exhibit a double …
Linear poroelasticity models have a number of important applications in biology and geophysics. In particular, Biot's consolidation model is a well-known model that describes the coupled interaction between the linear response of a porous elastic medium and a diffusive fluid flow within it, assuming small deformations. Although deterministic linear poroelasticity models and finite element methods for solving them numerically have been well studied, there is little work to date on robust algorithms for solving poroelasticity models with uncertain inputs and for performing uncertainty quantifica…
Weakly imposed symmetry and robust preconditioners for Biot's consolidation model
University of Oslo（奥斯陆大学）；The Institute for Computational and Engineering Sciences, University of Texas Austin（德克萨斯大学奥斯汀分校计算与工程科学研究所）；Simula Research Laboratory（西幕拉研究实验室）
This paper deals with solving a class of three-by-three block saddle point problems. The systems are solved by preconditioning techniques. Based on an iterative method, we construct a block upper triangular preconditioner. The convergence of the presented method is studied in details. Finally, some numerical experiments are given to demonstrate the superiority of the proposed preconditioner over some existing ones.
We study the performance of a new block preconditioner for a class of $3\times3$ block saddle point problems which arise from finite element methods for solving time-dependent Maxwell equations and some other practical problems. We also estimate the lower and upper bounds of eigenvalues of the preconditioned matrix. \cred{Finally, we examine our new preconditioner to accelerate the convergence speed of the GMRES method which shows the effectiveness of the preconditioner.
We consider the iterative solution of symmetric saddle-point matrices with a singular leading block. We develop a new ideal positive definite block diagonal preconditioner that yields a preconditioned operator with four distinct eigenvalues. We offer a few techniques for making the preconditioner practical, and illustrate the effectiveness of our approach with numerical experiments.
In this paper, a robust and effective preconditioner for the fast Method of Moments(MoM) based Hierarchal Electric Field Integral Equation(EFIE) solver is proposed using symmetric near-field Schur's complement method. In this preconditioner, near-field blocks are scaled to a diagonal block matrix and these near-field blocks are replaced with the scaled diagonal block matrix which reduces the near-field storage memory and the overall matrix vector product time. Scaled diagonal block matrix is further used as a preconditioner and due to the block diagonal form of the final preconditioner, no add…
We consider using the preconditioned-Krylov subspace method to solve the system of linear equations with a three-by-three block structure. By making use of the three-by-three block structure, eight inexact block factorization preconditioners, which can be put into a same theoretical analysis frame, are proposed based on a kind of inexact factorization. By generalizing Bendixson Theorem and developing a unified technique of spectral equivalence, the bounds of the real and imaginary parts of eigenvalues of the preconditioned matrices are obtained. The comparison to eleven existed exact and inexa…
We consider the problem of iteratively solving large and sparse double saddle-point systems arising from the stationary Stokes-Darcy equations in two dimensions, discretized by the Marker-and-Cell (MAC) finite difference method. We analyze the eigenvalue distribution of a few ideal block preconditioners. We then derive practical preconditioners that are based on approximations of Schur complements that arise in a block decomposition of the double saddle-point matrix. We show that including the interface conditions in the preconditioners is key in the pursuit of scalability. Numerical results s…
A limited-memory block bi-diagonal Toeplitz preconditioner for block lower triangular Toeplitz system from time-space fractional diffusion equation
University of Electronic Science and Technology of China（电子科技大学）；Southwestern University of Finance and Economics（西南财经大学）；Lanzhou University of Technology（兰州理工大学）
A new preconditioner based on a block $LDU$ factorization with algebraic multigrid subsolves for scalability is introduced for the large, structured systems appearing in implicit Runge-Kutta time integration of parabolic partial differential equations. This preconditioner is compared in condition number and eigenvalue distribution, and in numerical experiments with others in the literature: block Jacobi, block Gauss-Seidel, and the optimized block Gauss-Seidel method of Staff, Mardal, and Nilssen [{\em Modeling, Identification and Control}, 27 (2006), pp. 109-123]. Experiments are run on two t…
Optimal block preconditioners for a mass-conserving mixed stress formulation of Stokes flow
Mathematical Institute, University of Oxford（牛津大学数学研究所）；School of Science and Engineering, The Chinese University of Hong Kong, Shenzhen（香港中文大学（深圳）理工学院）
We propose a uniform block-diagonal preconditioner for condensed $H$(div)-conforming HDG schemes for parameter-dependent saddle point problems, including the generalized Stokes equations and the linear elasticity equations. An optimal preconditioner is obtained for the stiffness matrix on the global velocity/displacement space via the auxiliary space preconditioning (ASP) technique \cite{Xu96}. A spectrally equivalent approximation to the Schur complement on the element-wise constant pressure space is also constructed, and an explicit computable exact inverse is obtained via the Woodbury matri…
We consider symmetric positive definite preconditioners for multiple saddle-point systems of block tridiagonal form, which can be applied within the MINRES algorithm. We describe such a preconditioner for which the preconditioned matrix has only two distinct eigenvalues, 1 and -1, when the preconditioner is applied exactly. We discuss the relative merits of such an approach compared to a more widely studied block diagonal preconditioner, specify the computational work associated with applying the new preconditioner inexactly, and survey a number of theoretical results for the block diagonal ca…
In [McDonald, Pestana and Wathen, \textit{SIAM J. Sci. Comput.}, 40 (2018), pp. A1012--A1033], a block circulant preconditioner is proposed for all-at-once linear systems arising from evolutionary partial differential equations, in which the preconditioned matrix is proven to be diagonalizable and to have identity-plus-low-rank decomposition in the case of the heat equation. In this paper, we generalize the block circulant preconditioner by introducing a small parameter $ε>0$ into the top-right block of the block circulant preconditioner. The implementation of the generalized preconditioner re…
In this work we propose a novel block preconditioner, labelled Explicit Decoupling Factor Approximation (EDFA), to accelerate the convergence of Krylov subspace solvers used to address the sequence of non-symmetric systems of linear equations originating from flow simulations in porous media. The flow model is discretized blending the Mixed Hybrid Finite Element (MHFE) method for Darcy's equation with the Finite Volume (FV) scheme for the mass conservation. The EDFA preconditioner is characterized by two features: the exploitation of the system matrix decoupling factors to recast the Schur com…
The focus of this study is the construction and numerical validation of parallel block preconditioners for low order virtual element discretizations of the three-dimensional Maxwell equations. The virtual element method (VEM) is a recent technology for the numerical approximation of partial differential equations (PDEs), that generalizes finite elements to polytopal computational grids. So far, VEM has been extended to several problems described by PDEs, and recently also to the time-dependent Maxwell equations. When the time discretization of PDEs is performed implicitly, at each time-step a …
In this paper, we execute the shift-splitting preconditioner for asymmetric saddle point problems with its (1,2) block's transposition unequal to its (2,1) block under the removed minus of its (2,1) block. The proposed preconditioner is stemmed from the shift splitting (SS) iteration method for solving asymmetric saddle point problems, which is convergent under suitable conditions. The relaxed version of the shift-splitting preconditioner is obtained as well. The spectral distributions of the related preconditioned matrices are given. Numerical experiments from the Stokes problem are offered t…
In this work, we propose simple and efficient tridiagonal computed sparse preconditioners for improving the condition number for large compressed Electric Field Integral Equation (EFIE) Method of Moment (MoM) matrix. The preconditioner computation is based on the triangle and block triangle interaction and filled tridiagonally. The computed preconditioner is highly sparse and retains the O(N) complexity of computation and preconditioner matrix solution time. Numerical results show the efficiency and accuracy of the proposed preconditioner.
The Morse-Ingard equations of thermoacoustics are a system of coupled time-harmonic equations for the temperature and pressure of an excited gas. They form a critical aspect of modeling trace gas sensors. In this paper, we analyze a reformulation of the system that has a weaker coupling between the equations than the original form. We give a Gårding-type inequality for the system that leads to optimal-order asymptotic finite element error estimates. We also develop preconditioners for the coupled system. These are derived by writing the system as a 2x2 block system with pressure and temperatur…
We propose an unconditionally robust and highly effective preconditioner for general symmetric positive definite (SPD) matrices based on structured incomplete factorization (SIF), called enhanced SIF (eSIF) preconditioner. The original SIF strategy proposed recently derives a structured preconditioner by applying block diagonal preprocessing to the matrix and then compressing appropriate scaled off-diagonal blocks. Here, we use an enhanced scaling-and-compression strategy to design the new eSIF preconditioner. Some subtle modifications are made, such as the use of two-sided block triangular pr…
