The Gray–Scott (GS) model is a non-linear system of equations generally adopted to describe reaction–diffusion dynamics. In this paper, we discuss a numerical scheme for solving the GS system. The diffusion coefficients of the model are on surfaces and they depend on space and time. In this regard, we first adopt an implicit difference stepping method to semi-discretize the model in the time direction. Then, we implement a hybrid advanced meshless method for model discretization. In this way, we solve the GS problem with a radial basis function–finite difference (RBF-FD) algorithm combined with the closest point method (CPM). Moreover, we design a predictor–corrector algorithm to deal with the non-linear terms of this dynamic. In a practical example, we show the spot and stripe patterns with a given initial condition. Finally, we experimentally prove that the presented method provides benefits in terms of accuracy and performance for the GS system’s numerical solution.
Solving 3-d gray–scott systems with variable diffusion coefficients on surfaces by closest point method with rbf-fd / Raei, M.; Cuomo, S.; Colecchia, G.; Severino, G.. - In: MATHEMATICS. - ISSN 2227-7390. - 9:maggio(2021), p. 924. [10.3390/math9090924]
Solving 3-d gray–scott systems with variable diffusion coefficients on surfaces by closest point method with rbf-fd
Cuomo S.
;Colecchia G.;Severino G.
2021
Abstract
The Gray–Scott (GS) model is a non-linear system of equations generally adopted to describe reaction–diffusion dynamics. In this paper, we discuss a numerical scheme for solving the GS system. The diffusion coefficients of the model are on surfaces and they depend on space and time. In this regard, we first adopt an implicit difference stepping method to semi-discretize the model in the time direction. Then, we implement a hybrid advanced meshless method for model discretization. In this way, we solve the GS problem with a radial basis function–finite difference (RBF-FD) algorithm combined with the closest point method (CPM). Moreover, we design a predictor–corrector algorithm to deal with the non-linear terms of this dynamic. In a practical example, we show the spot and stripe patterns with a given initial condition. Finally, we experimentally prove that the presented method provides benefits in terms of accuracy and performance for the GS system’s numerical solution.File | Dimensione | Formato | |
---|---|---|---|
mathematics-09-00924-v4.pdf
accesso aperto
Tipologia:
Versione Editoriale (PDF)
Licenza:
Non specificato
Dimensione
962.11 kB
Formato
Adobe PDF
|
962.11 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.