Preconditioned modified Hermitian and skew-Hermitian splitting iteration methods for fractional nonlinear Schrödinger equations (Q2332740)

From MaRDI portal
Revision as of 05:41, 3 August 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Preconditioned modified Hermitian and skew-Hermitian splitting iteration methods for fractional nonlinear Schrödinger equations
scientific article

    Statements

    Preconditioned modified Hermitian and skew-Hermitian splitting iteration methods for fractional nonlinear Schrödinger equations (English)
    0 references
    0 references
    0 references
    0 references
    5 November 2019
    0 references
    The space-discretization of fractional coupled nonlinear Schrödinger equation \begin{align*} iu_t + \gamma(-\Delta )^{\frac{\alpha}{2}}u + \rho (|u|^2 + \beta |v|^2) & = 0, \\ iv_t + \gamma(-\Delta )^{\frac{\alpha}{2}}v + \rho (|v|^2 + \beta |u|^2) & = 0, \end{align*} leads to complex valued linear system with Toeplitz matrices. In order to avoid the complex valued arithmetic, the original complex linear system is transformed into equivalent two-by-two block real linear system and then the real linear system is solved by a preconditioned modified Hermitian and skew-Hermitian splitting iteration (PMHSS) method (see [\textit{Z.-Z. Bai}, J. Eng. Math. 93, 41--60 (2015; Zbl 1360.65089)]). The theoretical optimal parameter for the iteration scheme is analyzed by minimizing an upper bound of the spectral radius of the iteration matrix. An approximation for the optimal parameter is obtained. The numerical experiments show that the approximate optimal parameter is very close to the theoretical one. The numerical results indicate that the convergence of the proposed iterative scheme and the corresponding preconditioned GMRES method are independent of both the mesh size of the discretization and the fractional differential parameter. Numerical performance of both methods are compared in terms of the number of iterations and elapsed CPU time.
    0 references
    space fractional Schrödinger equations
    0 references
    Toeplitz matrix
    0 references
    iteration methods
    0 references
    convergence analysis
    0 references
    preconditioning
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references