This work presents an overview of the most relevant results obtained by the authors regarding the numerical solution of the Biot’s consolidation problem by preconditioning techniques. The emphasis here is on the design of parameter-robust preconditioners for the efficient solution of the algebraic system of equations resulting after proper discretization of such poroelastic problems. The classical two- and three-field formulations of the problem are considered, and block preconditioners are presented for some of the discretization schemes that have been proposed by the authors for these formulations. These discretizations have been proved to be well-posed with respect to the physical and discretization parameters, what provides a framework to develop preconditioners that are robust with respect to such parameters as well. In particular, we construct both norm-equivalent (block diagonal) and field-of-value-equivalent (block triangular) preconditioners, which are proved to be parameter-robust. The theoretical results on this parameter-robustness are demonstrated by considering typical benchmark problems in the literature for Biot’s model.
- Award ID(s):
- 1912902
- NSF-PAR ID:
- 10379239
- Date Published:
- Journal Name:
- International journal of numerical analysis and modeling
- Volume:
- 19
- Issue:
- 2-3
- ISSN:
- 1705-5105
- Page Range / eLocation ID:
- 220-236
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
more » « less
Abstract -
more » « less
Summary In this work, we provide new analysis for a preconditioning technique called structured incomplete factorization (SIF) for symmetric positive definite matrices. In this technique, a scaling and compression strategy is applied to construct SIF preconditioners, where off‐diagonal blocks of the original matrix are first scaled and then approximated by low‐rank forms. Some spectral behaviors after applying the preconditioner are shown. The effectiveness is confirmed with the aid of a type of two‐dimensional and three‐dimensional discretized model problems. We further show that previous studies on the robustness are too conservative. In fact, the practical multilevel version of the preconditioner has a robustness enhancement effect, and is unconditionally robust (or breakdown free) for the model problems regardless of the compression accuracy for the scaled off‐diagonal blocks. The studies give new insights into the SIF preconditioning technique and confirm that it is an effective and reliable way for designing structured preconditioners. The studies also provide useful tools for analyzing other structured preconditioners. Various spectral analysis results can be used to characterize other structured algorithms and study more general problems.
-
In this paper, we compare the performance between systems of ordinary and (Caputo) fractional differential equations depicting the susceptible-exposed-infectious-recovered (SEIR) models of diseases. In order to understand the origins of both approaches as mean-field approximations of integer and fractional stochastic processes, we introduce the fractional differential equations (FDEs) as approximations of some type of fractional nonlinear birth and death processes. Then, we examine validity of the two approaches against empirical courses of epidemics; we fit both of them to case counts of three measles epidemics that occurred during the pre-vaccination era in three different locations. While ordinary differential equations (ODEs) are commonly used to model epidemics, FDEs are more flexible in fitting empirical data and theoretically offer improved model predictions. The question arises whether, in practice, the benefits of using FDEs over ODEs outweigh the added computational complexities. While important differences in transient dynamics were observed, the FDE only outperformed the ODE in one of out three data sets. In general, FDE modeling approaches may be worth it in situations with large refined data sets and good numerical algorithms.more » « less
-
null (Ed.)Reactive force elds provide an a ordable model for simulating chemical reactions at a fraction of the cost of quantum mechanical approaches. However classically accounting for chemical reactivity often comes at the expense of accuracy and transferability, while computational cost is still large relative to non-reactive force elds. In this Perspective we summarize recent e orts for improving the performance of reactive force elds in these three areas with a focus on the ReaxFF theoretical model. To improve accuracy we describe recent reformulations of charge equilibration schemes to overcome unphysical long-range charge transfer, new ReaxFF models that account for explicit electrons, and corrections for energy conservation issues of the ReaxFF model. To enhance transferability we also highlight new advances to include explicit treatment of electrons in the ReaxFF and hybrid non-reactive/reactive simulations that make it possible to model charge transfer, redox chemistry, and large systems such as reverse micelles within the framework of a reactive force eld. To address the computational cost we review recent work in extended Lagrangian schemes and matrix preconditioners for accelerating the charge equilibration method component of ReaxFF and improvements in its software performance in LAMMPs.more » « less
-
more » « less
In this paper, we develop two fast implicit difference schemes for solving a class of variable‐coefficient time–space fractional diffusion equations with integral fractional Laplacian (IFL). The proposed schemes utilize the graded
L 1M ‐matrix analysis, which is from the spatial discretized matrix of IFL. Moreover, the proposed schemes use the fast sum‐of‐exponential approximation and Toeplitz matrix algorithms to reduce the computational cost for the nonlocal property of time and space fractional derivatives, respectively. The fast schemes greatly reduce the computational work of solving the discretized linear systems from by a direct solver to per preconditioned Krylov subspace iteration and a memory requirement from𝒪 (M N 2)𝒪 (N N e x p )N and( are the number of spatial and temporal grid nodes, respectively. The spectrum of preconditioned matrix is also given for ensuring the acceleration benefit of circulant preconditioners. Finally, numerical results are presented to show the utility of the proposed methods.N e x p ≪)M
- Free Publicly Accessible Full Text
-
Accepted Manuscript1.0
- Journal Article:
- The DOI is not currently available.
