Time-propagated

Once the grid (or two grids) are prepared, there are two similar types of approaches to propagate the initial wavefiinction forward with time. One approach is split-operator methods, [59] where the short-time propagator is divided into a kinetic and potential parts so that... 

Chen R Q and Guo H 1996 A general and efficient filter diagonalization method without time propagation J. Chem. Phys. 105 1311... 

The short-time propagator U ht) = becomes progressively more valid... 

The application of the kinetic energy part of the short-time propagator proceeds as follows ... 

The propagator nature of the Chebyshev operator is not merely a formality it has several important numerical implications.136 Because of the similarities between the exponential and cosine propagators, any formulation based on time propagation can be readily transplanted to one that is based on the Chebyshev propagation. In addition, the Chebyshev propagation can be implemented easily and exactly with no interpolation errors using Eq. [56], whereas in contrast the time propagator has to be approximated. 

Like the time propagation, the major computational task in Chebyshev propagation is repetitive matrix-vector multiplication, a task that is amenable to sparse matrix techniques with favorable scaling laws. The memory request is minimal because the Hamiltonian matrix need not be stored and its action on the recurring vector can be generated on the fly. Finally, the Chebyshev propagation can be performed in real space as long as a real initial wave packet and real-symmetric Hamiltonian are used. 

The Lanczos algorithm can also be used to approximate a short-time propagator. The so-called short-iterative Lanczos (SIL) method of Park and Light constructs a small set of Lanczos vectors,226 which can be summarized by Eq. [96] ... 

The most successful strategy for approximating the Liouville-von Neumann propagator is to interpolate the operator with polynomial operators. To this end, Newton and Faber polynomials have been suggested to globally approximate the propagator,126,127,225,232-234 as in Eq. [95]. For short-time propagation, short-iterative Arnoldi,235 dual Lanczos,236 and Chebyshev... 

Our main concern in this section is with the actual propagation forward in time of the wavepacket. The standard ways of solving the time-dependent Schrodinger equation are the Chebyshev expansion method proposed and popularised by Kossloff [16,18,20,37 0] and the split-operator method of Feit and Fleck [19,163,164]. I will not discuss these methods here as they have been amply reviewed in the references just quoted. Comparative studies [17-19] show conclusively that the Chebyshev expansion method is the most accurate and stable but the split-operator method allows for explicit time dependence in the Hamiltonian operator and is often faster when ultimate accuracy is not required. All methods for solving the time propagation of the wavepacket require the repeated operation of the Hamiltonian operator on the wavepacket. It is this aspect of the propagation that I will discuss in this section. 

Obtaining the exact rate (which is independent of qds), necessitates a real time propagation. A numerically exact solution is feasible for systems with a few degrees of freedom,already discussed above, there is still a way to go before one can rigorously implement the time evolution in a liquid. 

---