A Comparison of Methods for Determining the Time Step When Propagating with the Lanczos Algorithm
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 ste...
| Published in: | Mathematics |
|---|---|
| Main Authors: | , |
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2019-11-01
|
| Subjects: | |
| Online Access: | https://www.mdpi.com/2227-7390/7/11/1109 |