Low-order polynomial approximation of propagators for the time-dependent Schrödinger equation (Q1195470)

From MaRDI portal
Revision as of 19:57, 19 February 2024 by RedirectionBot (talk | contribs) (‎Removed claim: reviewed by (P1447): Item:Q592453)
scientific article
Language Label Description Also known as
English
Low-order polynomial approximation of propagators for the time-dependent Schrödinger equation
scientific article

    Statements

    Low-order polynomial approximation of propagators for the time-dependent Schrödinger equation (English)
    0 references
    0 references
    0 references
    0 references
    8 November 1992
    0 references
    This paper is an extremely interesting study of polynomial approximations for propagating the time-dependent Schrödinger equation. First and second-order Magnus expansions are tested for approximating the time ordering operator and the second-order expansion is found to be significantly better regardless of the method used. Two methods are used one of which is proved to be equivalent to the short time iterative Lanczos procedure. The second method which uses a different optimization scheme is found to be significantly superior in the examples used but further work is needed to establish this generally. It is believed that the second method is superior since it includes some information about the form of the function although it is not obvious why this should be generally better.
    0 references
    time-dependent Hamiltonian operators
    0 references
    residuum method
    0 references
    numerical examples
    0 references
    convergence
    0 references
    polynomial approximations
    0 references
    time-dependent Schrödinger equation
    0 references
    Magnus expansions
    0 references
    short time iterative Lanczos procedure
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references