Estimates of the convergence rate of explicit numerical methods on the base of approximate matrix exponent factorization for the time-dependent Schrödinger equation

MaRDI QIDQ2935772zbMATH OpenFDO

Authors V. M. Volkov, D. Yu. Dedkov

Publication date 30 December 2014

zbMATH Keywords

convergencestabilitynumerical experimenttime-dependent Schrödinger equation

Mathematics Subject Classification ID

Time-dependent Schrödinger equations and Dirac equations (35Q41) Stability and convergence of numerical methods for initial value and initial-boundary value problems involving PDEs (65M12)

Recommendations

• An accurate approximation of exponential integrators for the Schrödinger equation
• On the convergence of splitting methods for linear evolutionary Schrödinger equations involving an unbounded potential
• A high-order accuracy method for numerical solving of the time-dependent Schrödinger equation
• An explicit Hermite-Taylor method for the Schrödinger equation
• Splitting methods for the time-dependent Schrödinger equation

Cited in

(2)

• On stability of two-layer explicit schemes
• Super exponentially convergent approximation to the solution of the Schrödinger equation in abstract setting

This page was built for publication: Estimates of the convergence rate of explicit numerical methods on the base of approximate matrix exponent factorization for the time-dependent Schrödinger equation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2935772)