Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userA projection-based, semi-implicit time-stepping approach for the Cahn-Hilliard Navier-Stokes equations on adaptive octree meshes
154
0
0.0
(
0
)
Added by
Makrand Khanwale
Publication date
2021
fields
Informatics Engineering
and research's language is
English
Ask ChatGPT about the research
No Arabic abstract
We present a projection-based framework for solving a thermodynamically-consistent Cahn-Hilliard Navier-Stokes system that models two-phase flows. In this work we extend the fully implicit method presented in Khanwale et al. [{it A fully-coupled framework for solving Cahn-Hilliard Navier-Stokes equations: Second-order, energy-stable numerical methods on adaptive octree based meshes.}, arXiv:2009.06628 (2020)], to a block iterative hybrid method. We use a projection-based semi-implicit time discretization for the Navier-Stokes and a fully-implicit time discretization for the Cahn-Hilliard equation. We use a conforming continuous Galerkin (cG) finite element method in space equipped with a residual-based variational multiscale (RBVMS) formulation. Pressure is decoupled using a projection step, which results in two linear positive semi-definite systems for velocity and pressure, instead of the saddle point system of a pressure-stabilized method. All the linear systems are solved using an efficient and scalable algebraic multigrid (AMG) method. We deploy this approach on a massively parallel numerical implementation using parallel octree-based adaptive meshes. The overall approach allows the use of relatively large time steps with much faster time-to-solve. We present comprehensive numerical experiments showing detailed comparisons with results from the literature for canonical cases, including the single bubble rise and Rayleigh-Taylor instability.
rate research
Read More
We consider a computational model for complex-fluid-solid interaction based on a diffuse-interface model for the complex fluid and a hyperelastic-material model for the solid. The diffuse-interface complex-fluid model is described by the incompressible Navier-Stokes-Cahn-Hilliard equations with preferential-wetting boundary conditions at the fluid-solid interface. The corresponding fluid traction on the interface includes a capillary-stress contribution, and the dynamic interface condition comprises the traction exerted by the non-uniform fluid-solid surface tension. We present a weak formulation of the aggregated complex-fluid-solid-interaction problem, based on an Arbitrary-Lagrangian-Eulerian formulation of the Navier-Stokes-Cahn-Hilliard equations and a proper reformulation of the complex-fluid traction and the fluid-solid surface tension. To validate the presented complex-fluid-solid-interaction model, we present numerical results and conduct a comparison to experimental data for a droplet on a soft substrate.
This article is concerned with the discretisation of the Stokes equations on time-dependent domains in an Eulerian coordinate framework. Our work can be seen as an extension of a recent paper by Lehrenfeld & Olshanskii [ESAIM: M2AN, 53(2):585-614, 2019], where BDF-type time-stepping schemes are studied for a parabolic equation on moving domains. For space discretisation, a geometrically unfitted finite element discretisation is applied in combination with Nitsches method to impose boundary conditions. Physically undefined values of the solution at previous time-steps are extended implicitly by means of so-called ghost penalty stabilisations. We derive a complete a priori error analysis of the discretisation error in space and time, including optimal $L^2(L^2)$-norm error bounds for the velocities. Finally, the theoretical results are substantiated with numerical examples.
Using the Maslowski and Seidler method, the existence of invariant measure for 2-dimensional stochastic Cahn-Hilliard-Navier-Stokes equations with multiplicative noise is proved in state space $L_x^2times H^1$, working with the weak topology. Also, the existence of global pathwise solution is investigated using the stochastic compactness argument.
We propose an efficient, accurate and robust implicit solver for the incompressible Navier-Stokes equations, based on a DG spatial discretization and on the TR-BDF2 method for time discretization. The effectiveness of the method is demonstrated in a number of classical benchmarks, which highlight its superior efficiency with respect to other widely used implicit approaches. The parallel implementation of the proposed method in the framework of the deal.II software package allows for accurate and efficient adaptive simulations in complex geometries, which makes the proposed solver attractive for large scale industrial applications.
The Poisson-Nernst-Planck equations with generalized Frumkin-Butler-Volmer boundary conditions (PNP-FBV) describe ion transport with Faradaic reactions, and have applications in a number of fields. In this article, we develop an adaptive time-stepping scheme for the solution of the PNP-FBV equations based on two time-stepping methods: a fully implicit (BDF2) method, and an implicit-explicit (SBDF2) method. We present simulations under both current and voltage boundary conditions and demonstrate the ability to simulate a large range of parameters, including any value of the singular perturbation parameter $epsilon$. When the underlying dynamics is one that would have the solutions converge to a steady-state solution, we observe that the adaptive time-stepper based on the SBDF2 method produces solutions that ``nearly converge to the steady state and that, simultaneously, the time-step sizes stabilize to a limiting size $dt_infty$. In the companion to this article cite{YPD_Part2}, we linearize the SBDF2 scheme about the steady-state solution and demonstrate that the linearized scheme is conditionally stable. This conditional stability is the cause of the adaptive time-steppers behaviour. While the adaptive time-stepper based on the fully-implicit (BDF2) method is not subject to such time-step constraints, the required nonlinear solve yields run times that are significantly longer.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
