By the iteration of the theta-formula and treating the neighbors explicitly such as the unconditionally positive finite difference (UPFD) methods, we construct a new 2-stage explicit algorithm to solve partial differential equations containing a diffusion term and two reaction terms. One of the reaction terms is linear, which may describe heat convection, the other one is proportional to the fourth power of the variable, which can represent radiation. We analytically prove, for the linear case, that the order of accuracy of the method is two, and that it is unconditionally stable. We verify the method by reproducing an analytical solution with high accuracy. Then large systems with random parameters and discontinuous initial conditions are used to demonstrate that the new method is competitive against several other solvers, even if the nonlinear term is extremely large. Finally, we show that the new method can be adapted to the advection–diffusion-reaction term as well.

This paper introduces a set of new fully explicit numerical algorithms to solve the spatially discretized heat or diffusion equation. After discretizing the space and the time variables according to conventional finite difference methods, these new methods do not approximate the time derivatives by finite differences, but use a combined two-stage constant-neighbour approximation to decouple the ordinary differential equations and solve them analytically. In the final expression for the new values of the variable, the time step size appears not in polynomial or rational, but in exponential form with negative coefficients, which can guarantee stability. The two-stage scheme contains a free parameter p and we analytically prove that the convergence is second order in the time step size for all values of p and the algorithm is unconditionally stable if p is at least 0.5, not only for the linear heat equation, but for the nonlinear Fisher’s equation as well. We compare the performance of the new methods with analytical and numerical solutions. The results suggest that the new algorithms can be significantly faster than the widely used explicit or implicit methods, particularly in the case of extremely large stiff systems.