2018
DOI: 10.1016/j.amc.2018.07.017
|View full text |Cite
|
Sign up to set email alerts
|

A reduced high-order compact finite difference scheme based on proper orthogonal decomposition technique for KdV equation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4

Citation Types

0
7
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
8

Relationship

1
7

Authors

Journals

citations
Cited by 12 publications
(8 citation statements)
references
References 28 publications
0
7
0
Order By: Relevance
“…Besides, a large numbers of other numerical schemes have been devoted to solving KSE such as backward finite difference scheme proposed by Akrivis and Smyrlis (2004), robust Stackelberg controllability used by Montoya and Breton (2020), new iterative technique applied by Abed (2020), the semi-analytical scheme implemented by Shah, Khan, Baleanu, Kumam, and Arif (2020), discontinuous Galerkin scheme applied by Xu and Shu (2006), tanh-function scheme proposed by Fan (2000), Chebyshev spectral collocation method implemented by Khater and Temsah (2008), compact finite difference method employed by Singh, Arora, and Kumar (2018), compact fourth-order implicit-explicit Runge-Kutta method developed by Bhatt and Chowdhury (2019), compact finite difference method with orthogonal decomposition adopted by Zhang, Zhang, and Ding (2019) and lattice Boltzmann scheme implemented by Lai and Ma (2009). Each method used to solve KSE, still involves certain drawbacks like high arithmetic computations, lower accuracy in terms error, difficulty for computer programming and limitations of certain special cases.…”
Section: Introductionmentioning
confidence: 99%
“…Besides, a large numbers of other numerical schemes have been devoted to solving KSE such as backward finite difference scheme proposed by Akrivis and Smyrlis (2004), robust Stackelberg controllability used by Montoya and Breton (2020), new iterative technique applied by Abed (2020), the semi-analytical scheme implemented by Shah, Khan, Baleanu, Kumam, and Arif (2020), discontinuous Galerkin scheme applied by Xu and Shu (2006), tanh-function scheme proposed by Fan (2000), Chebyshev spectral collocation method implemented by Khater and Temsah (2008), compact finite difference method employed by Singh, Arora, and Kumar (2018), compact fourth-order implicit-explicit Runge-Kutta method developed by Bhatt and Chowdhury (2019), compact finite difference method with orthogonal decomposition adopted by Zhang, Zhang, and Ding (2019) and lattice Boltzmann scheme implemented by Lai and Ma (2009). Each method used to solve KSE, still involves certain drawbacks like high arithmetic computations, lower accuracy in terms error, difficulty for computer programming and limitations of certain special cases.…”
Section: Introductionmentioning
confidence: 99%
“…More generally, the general exact solution is hard to obtain and it can just be given in some special forms, therefore, numerical solutions and the corresponding analysis are very important in applications. There have been some numerical methods for solving KdV equation, such as meshless and collocation method [7][8][9][10], Hamiltonian boundary value method [11], Galerkin method [12][13][14][15][16], spectral method [17,18], lattice Boltzmann method [19,20], finite difference method [21][22][23][24][25][26], and others [27][28][29][30]. There are two main types of the problem, one is the periodic boundary value problem and another is the initial-boundary value problem.…”
Section: Introductionmentioning
confidence: 99%
“…Khaled et al [7] considered sinc collocation method to solve the periodic KdV equation and presented several numerical tests to show the accuracy. Zhang et al [26] focused on a high order difference scheme for the same problem. They established a sixth order scheme by proper orthogonal decomposition technique and gave some numerical examples to show the effectiveness.…”
Section: Introductionmentioning
confidence: 99%
“…Chen [5] provided high-order CFDS to solve parabolic equation. Especially, some attempts have been made whose main idea is to combine fourth Runge-Kutta in time and a sixth-order compact finite difference in space (CFDS6) by the researchers [6][7][8]. However, the CFDS6 for parabolic equation, especially the case of desirable accuracy in high dimension, they usually need small spatial discretization or extended finite difference stencils and a small time step which brings about heavy computational loads.…”
Section: Introductionmentioning
confidence: 99%