Big Chemical Encyclopedia

Chemical substances, components, reactions, process design ...

Articles Figures Tables About

Short time propagator

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... [Pg.2300]

The short-time propagator U ht) = becomes progressively more valid... [Pg.65]

The application of the kinetic energy part of the short-time propagator proceeds as follows ... [Pg.68]

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] ... [Pg.325]

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... [Pg.325]

For short time propagators entering into this equation one usually... [Pg.58]

The short-time propagators can be solved through application of the Dyson identity truncated to first order. The subsequent dynamics of the quantity of interest are obtained by propagating the classical variables along a surface that corresponds to the quantum state (aa1) followed by Monte Carlo sampling of the nonadiabatic transition events ... [Pg.392]

We remark that the simulation scheme for master equation dynamics has a number of attractive features when compared to quantum-classical Liouville dynamics. The solution of the master equation consists of two numerically simple parts. The first is the computation of the memory function which involves adiabatic evolution along mean surfaces. Once the transition rates are known as a function of the subsystem coordinates, the sequential short-time propagation algorithm may be used to evolve the observable or density. Since the dynamics is restricted to single adiabatic surfaces, no phase factors... [Pg.407]

D. Mac Kernan, R. Kapral, and G. Ciccotti. Sequential short-time propagation of quantum-classical dynamics sequential short-time propagation of quantum-classical dynamics. J. Phys. Condensed Matter, 14 9069, 2002. [Pg.411]

Since the Liouville operator is time independent and commutes with itself we may write the propagator exactly as the product of N short time propagators as... [Pg.419]

From left to right, the short-time propagator describes classical propagation on the Sj i surface through a time interval 6/2, a transition Sj 1 —> Sj determined by the elements of A4 and classical propagation on the Sj surface for a time interval 6/2. [Pg.421]

D. MacKernan, G. Ciccotti, and R. Kapral (2002) Sequential Short-Time Propagation of Quantum-Classical Dynamics. J. Phys. Condens. Matt. 14, pp. 9069-9076... [Pg.550]

We can now factorize the short time propagator in a different way (confr. [Pg.651]

In this new form, the widely oscillating potential energy is replaced by the local energy which is much smoother for an accurate We need to find the short time propagator of the importance sampling hamiltonian T-i which is nothing but the solution of the corresponding Bloch equation [19,21]... [Pg.651]

For N large enough, each short-time propagator, < j exp( - iHSt/h) qf j >,... [Pg.205]

In many physical applications the Hamiltonian is explicitly time dependent. The common solution for propagation in these explicitly time-dependent problems is to use very small grid spacing in time, such that within each time step the Hamiltonian H(r) is almost stationary. Under these semistationary conditions a short-time propagation method in the time-energy phase space is employed. The drawback of this solution is that it is based on extrapolation therefore the errors accumulate. Moreover, time ordering errors add with the usual numerical dispersion errors (108). [Pg.224]

The split-operator (SP) method is extremely popular and has been widely used in many practical applications. It approximates the short-time propagator by the equation... [Pg.233]

The Chebychev method converges exponentially with the number of expansion terms n for a given step size A and is particularly advantageous and efficient when A is large. However, unlike short-time propagators such as SOD or SP, the Chebychev method is not directly applicable to time-dependent or non-Hermitian Hamiltonians. [Pg.234]

To disentangle the short-time propagator, we use a (symmetrized) Trotter formula,... [Pg.52]


See other pages where Short time propagator is mentioned: [Pg.2316]    [Pg.306]    [Pg.68]    [Pg.71]    [Pg.140]    [Pg.206]    [Pg.311]    [Pg.185]    [Pg.249]    [Pg.375]    [Pg.185]    [Pg.59]    [Pg.61]    [Pg.392]    [Pg.421]    [Pg.114]    [Pg.81]    [Pg.561]    [Pg.562]    [Pg.649]    [Pg.651]    [Pg.225]    [Pg.208]    [Pg.8]    [Pg.2316]    [Pg.224]    [Pg.234]    [Pg.236]   
See also in sourсe #XX -- [ Pg.651 ]




SEARCH



Short-time propagator techniques

Split-operator short-time propagator

Split-operator short-time propagator method

Time propagation

Time propagator

© 2024 chempedia.info