Abstract

Chemotaxis systems are used to model the propagation, aggregation and pattern formation of bacteria/cells in response to an external stimulus, usually a chemical one. A common property of all chemotaxis systems is their ability to model a concentration phenomenon—rapid growth of the cell density in small neighborhoods of concentration points/curves. More precisely, the solution may develop singular, spiky structures, or even blow up in finite time. Therefore, the development of accurate and computationally efficient numerical methods for the chemotaxis models is a challenging task.We study the two-species Patlak–Keller–Segel type chemotaxis system, in which the two species do not compete, but have different chemotactic sensitivities, which may lead to a significantly difference in cell density growth rates. This phenomenon was numerically investigated in Kurganov and Lukáčová-Medviďová (2014) and Chertock et al. (2018), where second- and higher-order methods on uniform Cartesian grids were developed. However, in order to achieve high resolution of the density spikes developed by the species with a lower chemotactic sensitivity, a very fine mesh had to be utilized and thus the efficiency of the numerical method was affected.In this work, we consider an alternative approach relying on mesh adaptation, which helps to improve the approximation of the singular structures evolved by chemotaxis models. We develop, in particular, an adaptive moving mesh (AMM) finite-volume semi-discrete upwind method for the two-species chemotaxis system. The proposed AMM technique allows one to increase the density of mesh nodes at the blowup regions. This helps to substantially improve the resolution while using a relatively small number of finite-volume cells.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.