<p>The derivative nonlinear Schrödinger equation is one of the important classes of integrable systems with extensive applications in nonlinear optics. The numerical solution of the dynamic behavior remains a longstanding computational challenge due to its nonlinear term involving the derivative. In this paper, a second-type derivative nonlinear Schrödinger equation is considered numerically. The present numerical framework comprises two distinct temporal discretization strategies: Crank-Nicolson discretization and three-level average discretization. First of all, a linearized Crank-Nicolson-type scheme and the corresponding compact counterpart are derived at length. We then show that both numerical schemes preserve discrete momentum. Next, by means of the cut-off function method, we prove that the convergence rates of both numerical schemes under the discrete <InlineEquation ID="IEq1"> <EquationSource Format="TEX">\(L^\infty \)</EquationSource> <EquationSource Format="MATHML"><math> <msup> <mi>L</mi> <mi>∞</mi> </msup> </math></EquationSource> </InlineEquation>-norm are <InlineEquation ID="IEq2"> <EquationSource Format="TEX">\({\mathcal {O}}(\tau ^2+h^2)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi mathvariant="script">O</mi> <mo stretchy="false">(</mo> <msup> <mi>τ</mi> <mn>2</mn> </msup> <mo>+</mo> <msup> <mi>h</mi> <mn>2</mn> </msup> <mo stretchy="false">)</mo> </mrow> </math></EquationSource> </InlineEquation> or <InlineEquation ID="IEq3"> <EquationSource Format="TEX">\({\mathcal {O}}(\tau ^2+h^4)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi mathvariant="script">O</mi> <mo stretchy="false">(</mo> <msup> <mi>τ</mi> <mn>2</mn> </msup> <mo>+</mo> <msup> <mi>h</mi> <mn>4</mn> </msup> <mo stretchy="false">)</mo> </mrow> </math></EquationSource> </InlineEquation>, where <i>h</i> denotes the spatial step size and <InlineEquation ID="IEq4"> <EquationSource Format="TEX">\(\tau \)</EquationSource> <EquationSource Format="MATHML"><math> <mi>τ</mi> </math></EquationSource> </InlineEquation> denotes the temporal step size. In the meantime, we further derive a three-level average linearized scheme and a corresponding compact analogue for comparison. Discrete conservation quantity and error estimate are verified by taking advantage of several numerical examples with one-/two-soliton solutions. Compared with the implicit schemes in the literature, the numerical schemes in this paper are more efficient than those of the fully implicit ones up to date. More interestingly, numerical results collectively show that the Crank-Nicolson-type linearized difference schemes outperform three-level average linearized ones in the long-time simulation.</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Compact Fourth-Order Linearly Conservative Schemes for the Derivative Nonlinear Schrödinger Equation

  • Lianpeng Xue,
  • Qifeng Zhang

摘要

The derivative nonlinear Schrödinger equation is one of the important classes of integrable systems with extensive applications in nonlinear optics. The numerical solution of the dynamic behavior remains a longstanding computational challenge due to its nonlinear term involving the derivative. In this paper, a second-type derivative nonlinear Schrödinger equation is considered numerically. The present numerical framework comprises two distinct temporal discretization strategies: Crank-Nicolson discretization and three-level average discretization. First of all, a linearized Crank-Nicolson-type scheme and the corresponding compact counterpart are derived at length. We then show that both numerical schemes preserve discrete momentum. Next, by means of the cut-off function method, we prove that the convergence rates of both numerical schemes under the discrete \(L^\infty \) L -norm are \({\mathcal {O}}(\tau ^2+h^2)\) O ( τ 2 + h 2 ) or \({\mathcal {O}}(\tau ^2+h^4)\) O ( τ 2 + h 4 ) , where h denotes the spatial step size and \(\tau \) τ denotes the temporal step size. In the meantime, we further derive a three-level average linearized scheme and a corresponding compact analogue for comparison. Discrete conservation quantity and error estimate are verified by taking advantage of several numerical examples with one-/two-soliton solutions. Compared with the implicit schemes in the literature, the numerical schemes in this paper are more efficient than those of the fully implicit ones up to date. More interestingly, numerical results collectively show that the Crank-Nicolson-type linearized difference schemes outperform three-level average linearized ones in the long-time simulation.