<p>This paper constructs and analyzes an unconditionally optimal two-grid finite element algorithm with <InlineEquation ID="IEq6"> <EquationSource Format="TEX">\(\alpha \)</EquationSource> <EquationSource Format="MATHML"><math> <mi>α</mi> </math></EquationSource> </InlineEquation>-robustness on nonuniform time meshes for solving the nonlinear time-fractional Schrödinger equation with variable coefficient and a weak initial singularity. To address the weak initial singularity of the solution, we employ a unified formula that integrates the L1 and L2-<InlineEquation ID="IEq7"> <EquationSource Format="TEX">\(1_\sigma \)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mn>1</mn> <mi>σ</mi> </msub> </math></EquationSource> </InlineEquation> schemes on nonuniform time meshes. A two-grid Galerkin finite element method (FEM) in spatial dimensions is utilized to minimize computational expenses. The current two-grid method avoids imposing time-step restrictions that depend on the spatial-step size and alleviates the limitations on <i>f</i>(<i>u</i>) to a local Lipschitz continuity. The key is to achieve the unconditionally maximum boundedness of the fully discrete numerical solution and its gradient through a novel analysis. This is accomplished by applying the inverse inequality under the condition <InlineEquation ID="IEq8"> <EquationSource Format="TEX">\(N^{-\mu } \le h^{r+1}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msup> <mi>N</mi> <mrow> <mo>-</mo> <mi>μ</mi> </mrow> </msup> <mo>≤</mo> <msup> <mi>h</mi> <mrow> <mi>r</mi> <mo>+</mo> <mn>1</mn> </mrow> </msup> </mrow> </math></EquationSource> </InlineEquation>, while employing the discrete Sobolev embedding inequality when <InlineEquation ID="IEq9"> <EquationSource Format="TEX">\(N^{-\mu } \ge h^{r+1}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msup> <mi>N</mi> <mrow> <mo>-</mo> <mi>μ</mi> </mrow> </msup> <mo>≥</mo> <msup> <mi>h</mi> <mrow> <mi>r</mi> <mo>+</mo> <mn>1</mn> </mrow> </msup> </mrow> </math></EquationSource> </InlineEquation>, in conjunction with the cutoff technique and the auxiliary variable strategy. With the boundedness of the fully discrete solution and its gradient in the maximum norm established, we further demonstrate the unique solvability and unconditional stability of the fully discrete two-grid FEM scheme, deriving its unconditionally optimal error estimate with <InlineEquation ID="IEq10"> <EquationSource Format="TEX">\(\alpha \)</EquationSource> <EquationSource Format="MATHML"><math> <mi>α</mi> </math></EquationSource> </InlineEquation>-robustness under the <InlineEquation ID="IEq11"> <EquationSource Format="TEX">\(H^1\)</EquationSource> <EquationSource Format="MATHML"><math> <msup> <mi>H</mi> <mn>1</mn> </msup> </math></EquationSource> </InlineEquation>-norm, free from any temporal-spatial grid-ratio restrictions. The numerical outcomes support the theoretical conclusions and demonstrate that the proposed unconditionally convergent two-grid FEM algorithm surpasses conventional FEM in terms of efficiency.</p>

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

Unconditionally Optimal \(H^1\)-Error Analysis of a Two-Grid FEM with \(\alpha \)-Robustness for Nonlinear Time-Fractional Schrödinger Equation with a Weak Initial Singularity

  • Zhijun Tan

摘要

This paper constructs and analyzes an unconditionally optimal two-grid finite element algorithm with \(\alpha \) α -robustness on nonuniform time meshes for solving the nonlinear time-fractional Schrödinger equation with variable coefficient and a weak initial singularity. To address the weak initial singularity of the solution, we employ a unified formula that integrates the L1 and L2- \(1_\sigma \) 1 σ schemes on nonuniform time meshes. A two-grid Galerkin finite element method (FEM) in spatial dimensions is utilized to minimize computational expenses. The current two-grid method avoids imposing time-step restrictions that depend on the spatial-step size and alleviates the limitations on f(u) to a local Lipschitz continuity. The key is to achieve the unconditionally maximum boundedness of the fully discrete numerical solution and its gradient through a novel analysis. This is accomplished by applying the inverse inequality under the condition \(N^{-\mu } \le h^{r+1}\) N - μ h r + 1 , while employing the discrete Sobolev embedding inequality when \(N^{-\mu } \ge h^{r+1}\) N - μ h r + 1 , in conjunction with the cutoff technique and the auxiliary variable strategy. With the boundedness of the fully discrete solution and its gradient in the maximum norm established, we further demonstrate the unique solvability and unconditional stability of the fully discrete two-grid FEM scheme, deriving its unconditionally optimal error estimate with \(\alpha \) α -robustness under the \(H^1\) H 1 -norm, free from any temporal-spatial grid-ratio restrictions. The numerical outcomes support the theoretical conclusions and demonstrate that the proposed unconditionally convergent two-grid FEM algorithm surpasses conventional FEM in terms of efficiency.