IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v7y2019i11p1109-d287339.html
   My bibliography  Save this article

A Comparison of Methods for Determining the Time Step When Propagating with the Lanczos Algorithm

Author

Listed:
  • N. Mohankumar

    (40, DJ Nagar, Peelamedu 6410004, India)

  • Tucker Carrington

    (Chemistry Department, Queen’s University, Kingston, ON K7L 3N6, Canada)

Abstract

To use the short iterative Lanczos algorithm to solve the time-dependent Schroedinger equation, one must choose, for a given Lanczos space size, a time step. We compare the derivation of the well-known Lubich and Hochbruck time step from SIAM J. Numer. Anal. 34 (1997) 1911 with the a priori time step we proposed in Mohankumar and Carrington (MC) Comput. Phys. Commun., 181 (2010) 1859 and demonstrate that the MC time step is somewhat larger, i.e., that the MC error bound is tighter. In addition, we use the MC approach to derive an error bound and time step for imaginary time propagation. The error bound we derive is much tighter than the error bound of Stewart and Leyk.

Suggested Citation

  • N. Mohankumar & Tucker Carrington, 2019. "A Comparison of Methods for Determining the Time Step When Propagating with the Lanczos Algorithm," Mathematics, MDPI, vol. 7(11), pages 1-9, November.
    • Handle: RePEc:gam:jmathe:v:7:y:2019:i:11:p:1109-:d:287339
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/7/11/1109/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/7/11/1109/
    Download Restriction: no
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:7:y:2019:i:11:p:1109-:d:287339. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.