.png){kind=icon}
.png){kind=icon}
Return
A first-order computational algorithm for reaction-diffusion type equations via primal-dual hybrid gradient method
.png){kind=icon}
OA
AI
DOI：10.1016/j.jcp.2024.112753.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We propose an easy -to -implement iterative method for resolving the implicit (or semi -implicit) schemes arising in solving reaction -diffusion (RD) type equations. We formulate the nonlinear time implicit scheme as a min -max saddle point problem and then apply the primal -dual hybrid gradient (PDHG) method. Suitable precondition matrices are applied to the PDHG method to accelerate the convergence of algorithms under different circumstances. Furthermore, our method is applicable to various discrete numerical schemes with high flexibility. From various numerical examples tested in this paper, the proposed method converges properly and can efficiently produce numerical solutions with sufficient accuracy.
Keywords:
Primal-dual hybrid gradient algorithm
Reaction-diffusion equations
First order optimization algorithm
Implicit finite difference schemes
Preconditioners
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.8
Papers:
1.5W
Citations:
7.4W
