线性和非线性薛定谔方程的新型高精度传播方法
New, Highly Accurate Propagator for the Linear and Nonlinear Schrödinger Equation
AI总结:
研究了一种基于修正指数演化算子的多项式逼近的传播方法,用于求解时间相关薛定谔方程,并推广到处理时间相关右端项和时变或非线性算子的情形,数值实验验证了其高精度。
摘要:
研究了一种用于时间相关薛定谔方程的传播方法,该方法引出了求解常微分方程类型方程的一般方案。时间相关偏微分方程的标准空间离散化通常导致形如 u_t - G u = s 的常微分方程组,其中 G 是算子(矩阵),u 是时间相关的解向量。对于 G 是线性、时间无关矩阵且 s 是常向量的情况,已经开发了基于修正指数演化算子的多项式逼近的高精度方法。在本文中,我们将描述一种新算法,用于更一般的情况,其中 s 是时间相关的右端向量。该新算法的迭代版本可应用于 G 依赖于 t 或 u 的一般情况。将给出具有时间相关势的薛定谔方程和非线性薛定谔方程的数值结果。
英文摘要:
A propagation method for the time dependent Schrödinger equation was studied leading to a general scheme of solving ode type equations. Standard space discretization of time-dependent pde's usually results in system of ode's of the form u_t -Gu = s where G is a operator (matrix) and u is a time-dependent solution vector. Highly accurate methods, based on polynomial approximation of a modified exponential evolution operator, had been developed already for this type of problems where G is a linear, time independent matrix and s is a constant vector. In this paper we will describe a new algorithm for the more general case where s is a time-dependent r.h.s vector. An iterative version of the new algorithm can be applied to the general case where G depends on t or u. Numerical results for Schrödinger equation with time-dependent potential and to non-linear Schrödinger equation will be presented.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。