A time two-grid difference method for nonlinear generalized viscous Burgers’ equation

In this paper, we investigate a time two-grid algorithm to get the numerical solution of nonlinear generalized viscous Burgers’ equation, which is the first time that the two-grid method is used to solve this problem. Based on Crank–Nicolson finite difference scheme, we establish the time two-grid difference (TTGD) scheme which consists of three computational procedures to reduce the computational cost compared with the general finite difference (GFD) scheme. The cut-offf function method is applied to prove the conservation, unique solvability, the prior estimate and convergence in \(L^2\) $L^2$ -norm and \(L^{\infty }\) $L^{\infty }$ -norm of the TTGD scheme on the coarse grid and fine grid, respectively. Comparing our TTGD scheme with GFD scheme in Zhang et al. (Appl Math Lett 112:106719, 2021), we provided the proof the uniqueness the solution of the nonlinear scheme, direct proof of convergence in \(L^2\) $L^2$ -norm and the prior estimate both on the coarse mesh and fine mesh. The numerical results show that our TTGD scheme is more efficient than the GDF scheme in Zhang et al. (2021) in terms of the CPU time. Particularly, our method not only improves the efficiency, but also preserves the energy conservation of the original model.