@article{HUANG2026, 
author = {Deqing HUANG and Aiping FANG and Sirui Yi and Yishan Li and Chenwei JIANG and Xiuxing ZHANG and Xiaoli WANG},
title = {A TIME-EVOLUTION ALGORITHM FOR PARTIAL DIFFERENTIAL EQUATIONS DERIVED FROM THE STEADY-STATE SOLUTION OF THE BRUSSELATOR MODEL},
year = {2026},
journal = {Physics and Engineering},
volume = {36},
number = {1},
pages = {163-173},
keywords = {partial differential equations, time-evolution algorithm, Brusselator model, Turing patterns, finite difference method},
url = {https://www.sciopen.com/article/10.26599/PHYS.2026.9320123},
doi = {10.26599/PHYS.2026.9320123},
abstract = {For the two-dimensional Brusselator model, this paper obtains the steady-state solution of Turing patterns by using a time-evolution algorithm. Based on the research of the Brusselator model, we propose a new time-evolution algorithm for the boundary value problem of partial differential equations (PDEs). By introducing a virtual time parameter, the original boundary value problem is transformed into an initial value problem. Combining the finite difference method and the implicit iterative algorithm, the system evolution is simulated to approximate the steady-state solution, that is, the solution of the boundary value problem of the original equation set. The research shows that compared with the traditional Jacobi iterative method and Gauss-Seidel iterative method, the time-evolution algorithm exhibits stronger stability and convergence in complex non-linear problems. Further, this method is extended to the solution of Poisson's equation and Helmholtz equation. The results show that although the accuracy and efficiency of the time-evolution algorithm in general linear problems are slightly inferior to those of the Gauss-Seidel iterative method, in specific scenarios such as the Helmholtz equation with large wave numbers, its convergence speed and error accuracy are better. The time-evolution algorithm provides a new solution idea for the boundary value problem of non-linear PDEs. In the future, its performance can be further improved by combining high-order difference schemes and parallel computing strategies.}
}