IDEAS home Printed from https://ideas.repec.org/a/eee/matcom/v194y2022icp383-400.html
   My bibliography  Save this article

An efficient algorithm to compute the exponential of skew-Hermitian matrices for the time integration of the Schrödinger equation

Author

Listed:
  • Bader, Philipp
  • Blanes, Sergio
  • Casas, Fernando
  • Seydaoğlu, Muaz

Abstract

We present a practical algorithm to approximate the exponential of skew-Hermitian matrices up to round-off error based on an efficient computation of Chebyshev polynomials of matrices and the corresponding error analysis. It is based on Chebyshev polynomials of degrees 2, 4, 8, 12 and 18 which are computed with only 1, 2, 3, 4 and 5 matrix–matrix products, respectively. For problems of the form exp(−iA), with A a real and symmetric matrix, an improved version is presented that computes the sine and cosine of A with a reduced computational cost. The theoretical analysis, supported by numerical experiments, indicates that the new methods are more efficient than schemes based on rational Padé approximants and Taylor polynomials for all tolerances and time interval lengths. The new procedure is particularly recommended to be used in conjunction with exponential integrators for the numerical time integration of the Schrödinger equation.

Suggested Citation

  • Bader, Philipp & Blanes, Sergio & Casas, Fernando & Seydaoğlu, Muaz, 2022. "An efficient algorithm to compute the exponential of skew-Hermitian matrices for the time integration of the Schrödinger equation," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 194(C), pages 383-400.
    • Handle: RePEc:eee:matcom:v:194:y:2022:i:c:p:383-400
    DOI: 10.1016/j.matcom.2021.12.002
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378475421004365
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.matcom.2021.12.002?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Philipp Bader & Sergio Blanes & Fernando Casas, 2019. "Computing the Matrix Exponential with an Optimized Taylor Polynomial Approximation," Mathematics, MDPI, vol. 7(12), pages 1-19, December.
    2. Sastre, J. & Ibáñez, J. & Defez, E., 2019. "Boosting the computation of the matrix exponential," Applied Mathematics and Computation, Elsevier, vol. 340(C), pages 206-220.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Bogdan Mocan & Claudiu Schonstein & Mircea Murar & Calin Neamtu & Mircea Fulea & Mihaela Mocan & Simona Dragan & Horea Feier, 2023. "Upper-Limb Robotic Exoskeleton for Early Cardiac Rehabilitation Following an Open-Heart Surgery—Mathematical Modelling and Empirical Validation," Mathematics, MDPI, vol. 11(7), pages 1-43, March.
    2. Jorge Sastre & Javier Ibáñez, 2021. "Efficient Evaluation of Matrix Polynomials beyond the Paterson–Stockmeyer Method," Mathematics, MDPI, vol. 9(14), pages 1-23, July.
    3. Javier Ibáñez & Jorge Sastre & Pedro Ruiz & José M. Alonso & Emilio Defez, 2021. "An Improved Taylor Algorithm for Computing the Matrix Logarithm," Mathematics, MDPI, vol. 9(17), pages 1-19, August.
    4. Javier Ibáñez & José M. Alonso & Jorge Sastre & Emilio Defez & Pedro Alonso-Jordá, 2021. "Advances in the Approximation of the Matrix Hyperbolic Tangent," Mathematics, MDPI, vol. 9(11), pages 1-20, May.

    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:eee:matcom:v:194:y:2022:i:c:p:383-400. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Catherine Liu (email available below). General contact details of provider: http://www.journals.elsevier.com/mathematics-and-computers-in-simulation/ .

    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.