An efficient numerical method for reaction–diffusion equation on the general curved surfaces

In this paper, we propose an efficient numerical algorithm for reaction–diffusion equation on the general curved surface. The surface is discretized by a mesh consisting of triangular grids. The partial differential operators are defined based on the surface mesh and its dual surface polygonal tesse...

Full description

Saved in:
Bibliographic Details
Published in:Applied mathematics letters Vol. 133; p. 108268
Main Authors: Song, Xin, Li, Yibao
Format: Journal Article
Language:English
Published: Elsevier Ltd 01.11.2022
Subjects:
Curved surfaces
Reaction–diffusion equation
Second-order algorithm
Taylor expansion
Triangle surface mesh
Curved surfaces
Triangle surface mesh
Reaction–diffusion equation
Taylor expansion
Second-order algorithm
ISSN:0893-9659, 1873-5452
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this paper, we propose an efficient numerical algorithm for reaction–diffusion equation on the general curved surface. The surface is discretized by a mesh consisting of triangular grids. The partial differential operators are defined based on the surface mesh and its dual surface polygonal tessellation. The proposed method has three advantages including intrinsic geometry, conservation law, and convergence property. The proposed method only needs the information of 1-ring of neighboring vertices for the divergence of a vector field and the Laplace–Beltrami operators, while the numerical conservation laws still hold. The proposed method avoids the global surface triangulation and its implementation is simple since we can explicitly define the Laplace–Beltrami operator by using the information of the neighborhood of each triangular grid. In order to obtain second-order temporal accuracy, we utilize the Crank–Nicolson formula to the reaction–diffusion system. The discrete system is solved by the biconjugate gradient stabilized method. The proposed algorithm is simple to implement and is second-order accurate both in space and time. Various numerical experiments are presented to demonstrate the efficiency of our algorithm.
ISSN:0893-9659
1873-5452
DOI:10.1016/j.aml.2022.108268