- Journal Home
- Volume 43 - 2025
- Volume 42 - 2024
- Volume 41 - 2023
- Volume 40 - 2022
- Volume 39 - 2021
- Volume 38 - 2020
- Volume 37 - 2019
- Volume 36 - 2018
- Volume 35 - 2017
- Volume 34 - 2016
- Volume 33 - 2015
- Volume 32 - 2014
- Volume 31 - 2013
- Volume 30 - 2012
- Volume 29 - 2011
- Volume 28 - 2010
- Volume 27 - 2009
- Volume 26 - 2008
- Volume 25 - 2007
- Volume 24 - 2006
- Volume 23 - 2005
- Volume 22 - 2004
- Volume 21 - 2003
- Volume 20 - 2002
- Volume 19 - 2001
- Volume 18 - 2000
- Volume 17 - 1999
- Volume 16 - 1998
- Volume 15 - 1997
- Volume 14 - 1996
- Volume 13 - 1995
- Volume 12 - 1994
- Volume 11 - 1993
- Volume 10 - 1992
- Volume 9 - 1991
- Volume 8 - 1990
- Volume 7 - 1989
- Volume 6 - 1988
- Volume 5 - 1987
- Volume 4 - 1986
- Volume 3 - 1985
- Volume 2 - 1984
- Volume 1 - 1983
Cited by
- BibTex
- RIS
- TXT
This paper focuses on a fast and high-order finite difference method for two-dimensional space-fractional complex Ginzburg-Landau equations. We firstly establish a three-level finite difference scheme for the time variable followed by the linearized technique of the nonlinear term. Then the fourth-order compact finite difference method is employed to discretize the spatial variables. Hence the accuracy of the discretization is $\mathcal{O}(\tau^2+h_1^4+h_2^4)$ in $L_2$-norm, where $\tau$ is the temporal step-size, both $h_1$ and $h_2$ denote spatial mesh sizes in $x$- and $y$- directions, respectively. The rigorous theoretical analysis, including the uniqueness, the almost unconditional stability, and the convergence, is studied via the energy argument. Practically, the discretized system holds the block Toeplitz structure. Therefore, the coefficient Toeplitz-like matrix only requires $\mathcal{O} \big( M_{1}M_{2} \big)$ memory storage, and the matrix-vector multiplication can be carried out in $\mathcal{O} \big( M_{1}M_{2} (\log M_{1}+\log M_{2})\big)$ computational complexity by the fast Fourier transformation, where $M_1$ and $M_2$ denote the numbers of the spatial grids in two different directions. In order to solve the resulting Toeplitz-like system quickly, an efficient preconditioner with the Krylov subspace method is proposed to speed up the iteration rate. Numerical results are given to demonstrate the well performance of the proposed method.
}, issn = {1991-7139}, doi = {https://doi.org/10.4208/jcm.2005-m2020-0029}, url = {http://global-sci.org/intro/article_detail/jcm/19378.html} }This paper focuses on a fast and high-order finite difference method for two-dimensional space-fractional complex Ginzburg-Landau equations. We firstly establish a three-level finite difference scheme for the time variable followed by the linearized technique of the nonlinear term. Then the fourth-order compact finite difference method is employed to discretize the spatial variables. Hence the accuracy of the discretization is $\mathcal{O}(\tau^2+h_1^4+h_2^4)$ in $L_2$-norm, where $\tau$ is the temporal step-size, both $h_1$ and $h_2$ denote spatial mesh sizes in $x$- and $y$- directions, respectively. The rigorous theoretical analysis, including the uniqueness, the almost unconditional stability, and the convergence, is studied via the energy argument. Practically, the discretized system holds the block Toeplitz structure. Therefore, the coefficient Toeplitz-like matrix only requires $\mathcal{O} \big( M_{1}M_{2} \big)$ memory storage, and the matrix-vector multiplication can be carried out in $\mathcal{O} \big( M_{1}M_{2} (\log M_{1}+\log M_{2})\big)$ computational complexity by the fast Fourier transformation, where $M_1$ and $M_2$ denote the numbers of the spatial grids in two different directions. In order to solve the resulting Toeplitz-like system quickly, an efficient preconditioner with the Krylov subspace method is proposed to speed up the iteration rate. Numerical results are given to demonstrate the well performance of the proposed method.