In this study,we propose an efficient numerical framework to attain the solution of the extended Fisher-Kolmogorov(EFK)problem.The temporal derivative in the EFK equation is approximated by utilizing the Crank-Nicolso...In this study,we propose an efficient numerical framework to attain the solution of the extended Fisher-Kolmogorov(EFK)problem.The temporal derivative in the EFK equation is approximated by utilizing the Crank-Nicolson scheme.Following temporal discretization,the generalized finite difference method(GFDM)with supplementary nodes is utilized to address the nonlinear boundary value problems at each time node.These supplementary nodes are distributed along the boundary to match the number of boundary nodes.By incorporating supplementary nodes,the resulting nonlinear algebraic equations can effectively satisfy the governing equation and boundary conditions of the EFK equation.To demonstrate the efficacy of our approach,we present three numerical examples showcasing its performance in solving this nonlinear problem.展开更多
In this paper we consider the numerical method of characteristics for the numerical solution of initial value problems (IVPs) for quasilinear hyperbolic Partial Differential Equations, as well as the difference scheme...In this paper we consider the numerical method of characteristics for the numerical solution of initial value problems (IVPs) for quasilinear hyperbolic Partial Differential Equations, as well as the difference scheme Central Time Central Space (CTCS), Crank-Nicolson scheme, ω scheme and the method of characteristics for the numerical solution of initial and boundary value prob-lems for the one-dimension homogeneous wave equation. The initial deriva-tive condition is approximated by different second order difference quotients in order to examine which gives more accurate numerical results. The local truncation error, consistency and stability of the difference schemes CTCS, Crank-Nicolson and ω are also considered.展开更多
We study compact finite difference methods for the Schrodinger-Poisson equation in a bounded domain and establish their optimal error estimates under proper regularity assumptions on wave functionψand external potent...We study compact finite difference methods for the Schrodinger-Poisson equation in a bounded domain and establish their optimal error estimates under proper regularity assumptions on wave functionψand external potential V(x).The CrankNicolson compact finite difference method and the semi-implicit compact finite difference method are both of order O(h^(4)+τ^(2))in discrete l^(2),H^(1) and l^(∞) norms with mesh size h and time step τ.For the errors of compact finite difference approximation to the second derivative and Poisson potential are nonlocal,thus besides the standard energy method and mathematical induction method,the key technique in analysis is to estimate the nonlocal approximation errors in discrete l^(∞) and H^(1) norm by discrete maximum principle of elliptic equation and properties of some related matrix.Also some useful inequalities are established in this paper.Finally,extensive numerical results are reported to support our error estimates of the numerical methods.展开更多
The Alternating Segment Crank-Nicolson scheme for one-dimensional diffusion equation has been developed in [ 1 ], and the Alternating Block Crank-Nicolson method for two-dimensional problem in [2]. The methods have th...The Alternating Segment Crank-Nicolson scheme for one-dimensional diffusion equation has been developed in [ 1 ], and the Alternating Block Crank-Nicolson method for two-dimensional problem in [2]. The methods have the advantages of parallel computing, stability and good accuracy. Tn this paper for the two-dimensional diffusion equation, the net region is divided into bands, a special kind of block. This method is called the alternating Band Crank-Nicolson method.展开更多
By using the concept of multigraphs, the difference graphs of a class of alternating block Crank-Nicolson methods are defined and described, which extends the results on difference graphs of parallel computing for the...By using the concept of multigraphs, the difference graphs of a class of alternating block Crank-Nicolson methods are defined and described, which extends the results on difference graphs of parallel computing for the finite difference method.展开更多
基金supported by the Key Laboratory of Road Construction Technology and Equipment(Chang’an University,No.300102253502)the Natural Science Foundation of Shandong Province of China(GrantNo.ZR2022YQ06)the Development Plan of Youth Innovation Team in Colleges and Universities of Shandong Province(Grant No.2022KJ140).
文摘In this study,we propose an efficient numerical framework to attain the solution of the extended Fisher-Kolmogorov(EFK)problem.The temporal derivative in the EFK equation is approximated by utilizing the Crank-Nicolson scheme.Following temporal discretization,the generalized finite difference method(GFDM)with supplementary nodes is utilized to address the nonlinear boundary value problems at each time node.These supplementary nodes are distributed along the boundary to match the number of boundary nodes.By incorporating supplementary nodes,the resulting nonlinear algebraic equations can effectively satisfy the governing equation and boundary conditions of the EFK equation.To demonstrate the efficacy of our approach,we present three numerical examples showcasing its performance in solving this nonlinear problem.
文摘In this paper we consider the numerical method of characteristics for the numerical solution of initial value problems (IVPs) for quasilinear hyperbolic Partial Differential Equations, as well as the difference scheme Central Time Central Space (CTCS), Crank-Nicolson scheme, ω scheme and the method of characteristics for the numerical solution of initial and boundary value prob-lems for the one-dimension homogeneous wave equation. The initial deriva-tive condition is approximated by different second order difference quotients in order to examine which gives more accurate numerical results. The local truncation error, consistency and stability of the difference schemes CTCS, Crank-Nicolson and ω are also considered.
基金supported by Ministry of Education of Singapore grant R-146-000-120-112the National Natural Science Foundation of China(Grant No.11131005)the Doctoral Programme Foundation of Institution of Higher Education of China(Grant No.20110002110064).
文摘We study compact finite difference methods for the Schrodinger-Poisson equation in a bounded domain and establish their optimal error estimates under proper regularity assumptions on wave functionψand external potential V(x).The CrankNicolson compact finite difference method and the semi-implicit compact finite difference method are both of order O(h^(4)+τ^(2))in discrete l^(2),H^(1) and l^(∞) norms with mesh size h and time step τ.For the errors of compact finite difference approximation to the second derivative and Poisson potential are nonlocal,thus besides the standard energy method and mathematical induction method,the key technique in analysis is to estimate the nonlocal approximation errors in discrete l^(∞) and H^(1) norm by discrete maximum principle of elliptic equation and properties of some related matrix.Also some useful inequalities are established in this paper.Finally,extensive numerical results are reported to support our error estimates of the numerical methods.
基金The work presented in this paper was supported by the National Science Foundation of China
文摘The Alternating Segment Crank-Nicolson scheme for one-dimensional diffusion equation has been developed in [ 1 ], and the Alternating Block Crank-Nicolson method for two-dimensional problem in [2]. The methods have the advantages of parallel computing, stability and good accuracy. Tn this paper for the two-dimensional diffusion equation, the net region is divided into bands, a special kind of block. This method is called the alternating Band Crank-Nicolson method.
文摘By using the concept of multigraphs, the difference graphs of a class of alternating block Crank-Nicolson methods are defined and described, which extends the results on difference graphs of parallel computing for the finite difference method.