NANAJan 11, 2016

An implicit midpoint difference scheme for the fractional Ginzburg-Landau equation

arXiv:1601.0230174 citationsh-index: 37
Originality Synthesis-oriented
AI Analysis

It provides a stable and convergent numerical method for solving nonlinear fractional PDEs, which is important for computational mathematics.

This paper proposes an efficient difference scheme for the fractional Ginzburg-Landau equation, achieving unconditional optimal convergence order O(τ² + h²) in the l²_h norm.

This paper proposes and analyzes an efficient difference scheme for the nonlinear complex Ginzburg-Landau equation involving fractional Laplacian. The scheme is based on the implicit midpoint rule for the temporal discretization and a weighted and shifted Grünwald difference operator for the spatial fractional Laplacian. By virtue of a careful analysis of the difference operator, some useful inequalities with respect to suitable fractional Sobolev norms are established. Then the numerical solution is shown to be bounded, and convergent in the $l^2_h$ norm with the optimal order $O(τ^2+h^2)$ with time step $τ$ and mesh size $h$. The a priori bound as well as the convergence order hold unconditionally, in the sense that no restriction on the time step $τ$ in terms of the mesh size $h$ needs to be assumed. Numerical tests are performed to validate the theoretical results and effectiveness of the scheme.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes