Adaptive optimal m-stage Runge-Kutta methods for solving reaction-diffusion-chemotaxis systems

2Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We present a class of numerical methods for the reaction-diffusion- chemotaxis system which is significant for biological and chemistry pattern formation problems. To solve reaction-diffusion-chemotaxis systems, efficient and reliable numerical algorithms are essential for pattern generations. Along with the implementation of the method of lines, implicit or semi-implicit schemes are typical time stepping solvers to reduce the effect on time step constrains due to the stability condition. However, these two schemes are usually difficult to employ. In this paper, we propose an adaptive optimal time stepping strategy for the explicit m-stage Runge-Kutta method to solve reaction-diffusion-chemotaxis systems. Instead of relying on empirical approaches to control the time step size, variable time step sizes are given explicitly. Yet, theorems about stability and convergence of the algorithm are provided in analyzing robustness and efficiency. Numerical experiment results on a testing problem and a real application problem are shown. © 2011 Jui-Ling Yu.

Cite

CITATION STYLE

APA

Yu, J. L. (2011). Adaptive optimal m-stage Runge-Kutta methods for solving reaction-diffusion-chemotaxis systems. Journal of Applied Mathematics, 2011. https://doi.org/10.1155/2011/389207

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free