skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.


Title: Some Optimally Convergent Algorithms for Decoupling the Computation of Biot’s Model
We study numerical algorithms for solving Biot’s model. Based on a three-field reformulation, we present some algorithms that are inspired by the work of Chaabane et al. (Comput MathAppl 75(7):2328–2337) and Lee (Unconditionally stable second order convergent partitioned methods for multiple-network poroelasticity arXiv:1901.06078, 2019) for decoupling the computation of Biot’s model. A new theoretical framework is developed to analyze the algorithms. Considering a uniform temporal discretization, these algorithms solve the coupled model on the first time level. On the remaining time levels, one algorithm solves a reaction-diffusion subproblem first and then solves a generalized Stokes subproblem.Another algorithm reverses the order of solving the two subproblems. Our algorithms manage to decouple the numerical computation of the coupled system while retaining the convergence properties of the original coupled algorithm. Theoretical analysis is conducted to show that these algorithms are unconditionally stable and optimally convergent.Numerical experiments are also carried out to validate the theoretical analysis and demonstrate the advantages of the proposed algorithms.  more » « less
Award ID(s):
1831950 1700328
PAR ID:
10471422
Author(s) / Creator(s):
; ; ;
Publisher / Repository:
Springer
Date Published:
Journal Name:
Journal of Scientific Computing
Volume:
97
Issue:
2
ISSN:
0885-7474
Subject(s) / Keyword(s):
Biot’s model, Decoupled algorithms, Finite element method, Unconditionally stable.
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. Abstract We consider a family of variable time-stepping Dahlquist-Liniger-Nevanlinna (DLN) schemes, which is unconditionally non-linear stable and second order accurate, for the Allen-Cahn equation. The finite element methods are used for the spatial discretization. For the non-linear term, we combine the DLN scheme with two efficient temporal algorithms: partially implicit modified algorithm and scalar auxiliary variable algorithm. For both approaches, we prove the unconditional, long-term stability of the model energy under any arbitrary time step sequence. Moreover, we provide rigorous error analysis for the partially implicit modified algorithm with variable time-stepping. Efficient time-adaptive algorithms based on these schemes are also proposed. Several one- and two-dimensional numerical tests are presented to verify the properties of the proposed time-adaptive DLN methods. 
    more » « less
  2. The original Bérenger’s perfectly matched layer (PML) was quite effective in simulating wave propagation problem in unbounded domains. But its stability is very challenging to prove. Later, some equivalent PML models were developed by Bécache and Joly [ ESAIM: M2AN 36 (2002) 87–119] and their stabilities were established. Hence studying and developing efficicent numerical methods for solving those equivalent PML models are needed and interesting. Here we propose a novel explicit unconditionally stable finite element scheme to solve an equivalent Bérenger’s PML model. Both the stability and convergence analysis are proved for the proposed scheme. Numerical results justifying the theoretical analysis are presented. We also demonstrate the effectiveness of this PML in simulating wave propagation in the free space. To our best knowledge, this is the first explicit unconditionally stable finite element scheme developed for this PML model. 
    more » « less
  3. Abstract We propose two mass and heat energy conservative, unconditionally stable, decoupled numerical algorithms for solving the Cahn–Hilliard–Navier–Stokes–Darcy–Boussinesq system that models thermal convection of two‐phase flows in superposed free flow and porous media. The schemes totally decouple the computation of the Cahn–Hilliard equation, the Darcy equations, the heat equation, the Navier–Stokes equations at each time step, and thus significantly reducing the computational cost. We rigorously show that the schemes are conservative and energy‐law preserving. Numerical results are presented to demonstrate the accuracy and stability of the algorithms. 
    more » « less
  4. Inverse kinematics solves the problem of how to control robot arm joints to achieve desired end effector positions, which is critical to any robot arm design and implemen- tations of control algorithms. It is a common misunderstanding that closed-form inverse kinematics analysis is solved. Popular software and algorithms, such as gradient descent or any multi-variant equations solving algorithm, claims solving inverse kinematics but only on the numerical level. While the numerical inverse kinematics solutions are rela- tively straightforward to obtain, these methods often fail, due to dependency on specific numerical values, even when the inverse kinematics solutions exist. Therefore, closed-form inverse kinematics analysis is superior, but there is no generalized automated algorithm. Up till now, the high-level logical reasoning involved in solving closed-form inverse kine- matics made it hard to automate, so it’s handled by human experts. We developed IKBT, a knowledge-based intelligent system that can mimic human experts’ behaviors in solving closed-from inverse kinematics using Behavior Tree. Knowledge and rules used by engineers when solving closed-from inverse kinematics are encoded as actions in Behavior Tree. The order of applying these rules is governed by higher level composite nodes, which resembles the logical reasoning process of engineers. It is also the first time that the dependency of joint variables, an important issue in inverse kinematics analysis, is automatically tracked in graph form. Besides generating closed-form solutions, IKBT also explains its solving strategies in human (engineers) interpretable form. This is a proof-of-concept of using Behavior Trees to solve high-cognitive problems. 
    more » « less
  5. null (Ed.)
    We construct a numerical scheme based on the scalar auxiliary variable (SAV) approach in time and the MAC discretization in space for the Cahn–Hilliard–Navier–Stokes phase- field model, prove its energy stability, and carry out error analysis for the corresponding Cahn–Hilliard–Stokes model only. The scheme is linear, second-order, unconditionally energy stable and can be implemented very efficiently. We establish second-order error estimates both in time and space for phase-field variable, chemical potential, velocity and pressure in different discrete norms for the Cahn–Hilliard–Stokes phase-field model. We also provide numerical experiments to verify our theoretical results and demonstrate the robustness and accuracy of our scheme. 
    more » « less