Derivation and error analysis of three-level linearized difference schemes for solving the Burgers-Fisher equation

The main scope of this paper is to develop and analyse three-level linearized difference schemes for solving the classical Burgers-Fisher equation. For the Dirichlet boundary value problem, the first three-level linearized difference scheme is second-order accurate in both time and space. It is able to obey a discrete conservative law. By the discrete energy argument and induction, it is rigorously proved to be uniquely solvable and unconditionally convergent. Furthermore, with the purpose of improving the numerical accuracy in space, another three-level linearized compact difference scheme is then established together with some investigation on its discrete conservation law, unique solvability and unconditional convergence of order two in time and four in space. The coupled nonlinearity of Burgers' type and Fisher type is intensively treated via the order of reduction and Taylor expansion. In addition, extensions to the problem subject to the periodic boundary condition (PBC) are involved. To the best of our knowledge, this is a rare work to carefully design and rigorously analyse the high-order linearized difference schemes for solving the Burgers-Fisher equation. Numerical tests are provided to support the theoretical results and to verify the computational efficiency.

Authors

Institutions

Publication Details

Journal
The Journal of Difference Equations and Applications
Published
2024-08-12
DOI
https://doi.org/10.1080/10236198.2024.2388780
Citations
2
Primary Topic
Differential Equations and Numerical Methods
Type
article
Field-Weighted Citation Impact
0.73
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Derivation and error analysis of three-level linearized difference schemes for solving the Burgers-Fisher equation

Guang‐hua Gao, Yanping Chen, Biao Ge
2 citations
The Journal of Difference Equations and Applications
Differential Equations and Numerical Methods
0.73
article

Derivation and error analysis of three-level linearized difference schemes for solving the Burgers-Fisher equation

Guang‐hua Gao, Yanping Chen, Biao Ge
article en
2 citations

Abstract

The main scope of this paper is to develop and analyse three-level linearized difference schemes for solving the classical Burgers-Fisher equation. For the Dirichlet boundary value problem, the first three-level linearized difference scheme is second-order accurate in both time and space. It is able to obey a discrete conservative law. By the discrete energy argument and induction, it is rigorously proved to be uniquely solvable and unconditionally convergent. Furthermore, with the purpose of improving the numerical accuracy in space, another three-level linearized compact difference scheme is then established together with some investigation on its discrete conservation law, unique solvability and unconditional convergence of order two in time and four in space. The coupled nonlinearity of Burgers' type and Fisher type is intensively treated via the order of reduction and Taylor expansion. In addition, extensions to the problem subject to the periodic boundary condition (PBC) are involved. To the best of our knowledge, this is a rare work to carefully design and rigorously analyse the high-order linearized difference schemes for solving the Burgers-Fisher equation. Numerical tests are provided to support the theoretical results and to verify the computational efficiency.

The Journal of Difference Equations and ApplicationsVol. 31(1)
Nanjing University of Posts and Telecommunications (CN)
Openalex Percentile: Top 33%
Differential Equations and Numerical Methods
0.73
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.