PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
April 17, 2026Wuli yu gongcheng.0 citationsOpen Access

A Time-Evolution Algorithm for Partial Differential Equations Derived From the Steady-State Solution of the Brusselator Model

DHDeqing HUANGAFAiping FANGSYSirui Yi

Key Points

  • The aim is to develop a new time-evolution algorithm for solving boundary value problems derived from the Brusselator model.
  • Derived steady-state solutions from the Brusselator model.
  • Transformed boundary value problems into initial value problems using a virtual time parameter.
  • Combined finite difference method with implicit iterative algorithms.
  • Simulated system evolution to approximate steady-state solutions.
  • The time-evolution algorithm shows stronger stability and convergence than Jacobi and Gauss-Seidel methods in complex non-linear problems.
  • While it is less accurate in general linear problems versus Gauss-Seidel, it outperforms in specific cases like the Helmholtz equation with high wave numbers.
  • The method offers a novel approach to non-linear PDE boundary value problems and has potential for future improvements with advanced techniques.

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.

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

HUANG et al. (2026) studied this question.

synapsesocial.com/papers/69e1cdc45cdc762e9d857164https://doi.org/10.26599/phys.2026.9320123
Ask AI
Helpful
Bookmark
Share
View Full Paper