Search arXivSearch

arXiv · 2506.06792

Fully discrete finite element approximation for the projection method to solve the Chemotaxis-Fluid System

Abstract

In this paper, we investigate a chemotaxis-fluid interaction model governed by the incompressible Navier-Stokes equations coupled with the classical Keller-Segel chemotaxis system. To numerically solve this coupled system, we develop a pressure-correction projection finite element method based on a projection framework. The proposed scheme employs a backward Euler method for temporal discretization and a mixed finite element method for spatial discretization. Nonlinear terms are treated semi-implicitly to enhance computational stability and efficiency. We further establish rigorous error estimates for the fully discrete scheme, demonstrating the convergence of the numerical method. A series of numerical experiments are conducted to validate the stability, accuracy, and effectiveness of the proposed method. The results confirm the scheme's capability to capture the essential dynamical behaviors and characteristic features of the chemotaxis-fluid system.

Explore related subjects

Keep this discovery

BibTeXRIS

Chenyang Li, Ping Lin, Haibiao Zheng. 2025-11-27. Fully discrete finite element approximation for the projection method to solve the Chemotaxis-Fluid System. https://doi.org/10.1016/j.cnsns.2026.110099

Cite the original work for its findings. Save a collection to share your selection of sources.

Discover connections

Connections use source metadata and explicit phrase matches, not verified experimental comparisons.

KEEP EXPLORING

Related papers

Numerical experiments on the Hardy conjecture for the Gauss circle problem

The classical unsolved Gauss circle problem concerns estimating the error between the number of lattice points inside a circle and the area of the circle as its radius tends to infinity. About a century ago, Hardy proposed a conjecture concerning this problem. In this paper, we attempt to provide numerical evidence in support of the Hardy conjecture through large-scale numerical computations.

math.NT

Advancements in Spectral Collocation Methods for High-Order Eigenvalue Problems

This paper focuses on computing spectral solutions for high-order eigenvalue problems using an efficient discretization method based on Chebfun spectral discretization algorithms and domain truncation. We solve several numerical eigenvalue problems, demonstrating both the accuracy and computational efficiency of the proposed approach.

math.NA

$L^p$-Convergence Rate of Backward Euler Schemes for Monotone SDEs

We give a unified method to derive the strong convergence rate of the backward Euler scheme for monotone SDEs in $L^p(Ω)$-norm, with general $p \ge 4$. The results are applied to the backward Euler scheme of SODEs with polynomial growth coefficients. We also generalize the argument to the Galerkin-based backward Euler scheme of SPDEs with polynomial growth coefficients driven by multiplicative trace-class noise.

math.NA