- Journal Home
- Volume 18 - 2025
- Volume 17 - 2024
- Volume 16 - 2023
- Volume 15 - 2022
- Volume 14 - 2021
- Volume 13 - 2020
- Volume 12 - 2019
- Volume 11 - 2018
- Volume 10 - 2017
- Volume 9 - 2016
- Volume 8 - 2015
- Volume 7 - 2014
- Volume 6 - 2013
- Volume 5 - 2012
- Volume 4 - 2011
- Volume 3 - 2010
- Volume 2 - 2009
- Volume 1 - 2008
Numer. Math. Theor. Meth. Appl., 16 (2023), pp. 634-667.
Published online: 2023-08
Cited by
- BibTex
- RIS
- TXT
A three-level linearized difference scheme for solving the Fisher equation is firstly proposed in this work. It has the good property of discrete conservative energy. By the discrete energy analysis and mathematical induction method, it is proved to be uniquely solvable and unconditionally convergent with the second-order accuracy in both time and space. Then another three-level linearized compact difference scheme is derived along with its discrete energy conservation law, unique solvability and unconditional convergence of order two in time and four in space. The resultant schemes preserve the maximum bound principle. The analysis techniques for convergence used in this paper also work for the Euler scheme, the Crank-Nicolson scheme and others. Numerical experiments are carried out to verify the computational efficiency, conservative law and the maximum bound principle of the proposed difference schemes.
}, issn = {2079-7338}, doi = {https://doi.org/10.4208/nmtma.OA-2022-0123}, url = {http://global-sci.org/intro/article_detail/nmtma/21961.html} }A three-level linearized difference scheme for solving the Fisher equation is firstly proposed in this work. It has the good property of discrete conservative energy. By the discrete energy analysis and mathematical induction method, it is proved to be uniquely solvable and unconditionally convergent with the second-order accuracy in both time and space. Then another three-level linearized compact difference scheme is derived along with its discrete energy conservation law, unique solvability and unconditional convergence of order two in time and four in space. The resultant schemes preserve the maximum bound principle. The analysis techniques for convergence used in this paper also work for the Euler scheme, the Crank-Nicolson scheme and others. Numerical experiments are carried out to verify the computational efficiency, conservative law and the maximum bound principle of the proposed difference schemes.