Trajectory conditions

When identifying the events present in recent accident trajectories, conditions regarding the availability of information must be considered. In this case, as with... 

Since every phase point (except for uninteresting ones accessible from neither A nor C) satisfies one of the two trajectory conditions above and no phase point satisfies both, the two terms add up to the equilibrium density on the other hand, each term separately represents the situation in which an equilibrium distribution of trajectories attacks the bottleneck from one... 

Using the theorem that the sufficiency condition for mathematical correctness in 3D-reconstruction is fulfilled if all planes intersecting the object have to intersect the source-trajectory at least in one point [8], it is possible to generalise Feldkamp s method. Using projection data measured after changing the sotuce-trajectory from circular to spiral focus orbit it is possible to reconstruct the sample volume in a better way with the Wang algorithm [9]. 

Another efficient and practical method for exact 3D-reconstruction is the Grangeat algorithm [11]. First the derivative of the three-dimensional Radon transfomi is computed from the Cone-Beam projections. Afterwards the 3D-Object is reconstructed from the derivative of the Radon transform. At present time this method is not available for spiral orbits, instead two perpendicular circular trajectories are suitable to meet the above sufficiency condition. 

Equation (B1.7.6) describes the ion trajectories in the quadnipole field (where u can be either v ory). The stable, bounded solutions to these equations represent conditions of stable, bounded trajectories in the... 

Even expression ( B3.4.31), altiiough numerically preferable, is not the end of the story as it does not fiilly account for the fact diat nearby classical trajectories (those with similar initial conditions) should be averaged over. One simple methodology for that averaging has been tln-ough the division of phase space into parts, each of which is covered by a set of Gaussians [159, 160]. This is done by recasting the initial wavefunction as... 

Figure C2.5.9. Examples of folding trajectories iT=T derived from the condition = 0.21. (a) Fast folding trajectory as monitored by y/t). It can be seen that sequence reaches the native state very rapidly in a two-state manner without being trapped in intennediates. The first passage time for this trajectory is 277 912 MCS. (b) Slow folding trajectory for the same sequence. The sequence becomes trapped in several intennediate states with large y en route to the native state. The first passage time is 11 442 793 MCS. Notice that the time scales in both panels are dramatically different.

It is convenient to analyse tliese rate equations from a dynamical systems point of view similar to tliat used in classical mechanics where one follows tire trajectories of particles in phase space. For tire chemical rate law (C3.6.2) tire phase space , conventionally denoted by F, is -dimensional and tire chemical concentrations, CpC2,- are taken as ortliogonal coordinates of F, ratlier tlian tire particle positions and velocities used as tire coordinates in mechanics. In analogy to classical mechanical systems, as tire concentrations evolve in time tliey will trace out a trajectory in F. Since tire velocity functions in tire system of ODEs (C3.6.2) do not depend explicitly on time, a given initial condition in F will always produce tire same trajectory. The vector R of velocity functions in (C3.6.2) defines a phase-space (or trajectory) flow and in it is often convenient to tliink of tliese ODEs as describing tire motion of a fluid in F with velocity field/ (c p). 

As already mentioned, the motion of a chaotic flow is sensitive to initial conditions [H] points which initially he close together on the attractor follow paths that separate exponentially fast. This behaviour is shown in figure C3.6.3 for the WR chaotic attractor at /c 2=0.072. The instantaneous rate of separation depends on the position on the attractor. However, a chaotic orbit visits any region of the attractor in a recurrent way so that an infinite time average of this exponential separation taken along any trajectory in the attractor is an invariant quantity that characterizes the attractor. If y(t) is a trajectory for the rate law fc3.6.2] then we can linearize the motion in the neighbourhood of y to get... 

We have found that display of nuclear trajectories and the simultaneous evolution of charge distributions to yield insightful details of complicated processes. Such descriptions also map more readily to the actual experimental conditions than do the more conventional time-independent scattering matrix descriptions. 

In applying minimal END to processes such as these, one finds that different initial conditions lead to different product channels. In Figure 1, we show a somewhat truncated time lapse picture of a typical trajectory that leads to abstraction. In this rendering, one of the hydrogens of NHaD" " is hidden. As an example of properties whose evolution can be depicted we display interatomic distances and atomic electronic charges. Obviously, one can similarly study the time dependence of various other properties during the reactive encounter. 

These charge-transfer structures have been studied [4] in terms a very limited number of END trajectories to model vibrational induced electron tiansfer. An electronic 3-21G-1- basis for Li [53] and 3-21G for FI [54] was used. The equilibrium structure has the geometry with a long Li(2)—FI bond (3.45561 a.u.) and a short Li(l)—H bond (3.09017 a.u.). It was first established that only the Li—H bond stietching modes will promote election transfer, and then initial conditions were chosen such that the long bond was stretched and the short bond compressed by the same (%) amount. The small ensemble of six trajectories with 5.6, 10, 13, 15, 18, and 20% initial change in equilibrium bond lengths are sufficient to illustrate the approach. 

In what is called BO MD, the nuclear wavepacket is simulated by a swarm of trajectories. We emphasize here that this does not necessarily mean that the nuclei are being treated classically. The difference is in the chosen initial conditions. A fully classical treatment takes the initial positions and momenta from a classical ensemble. The use of quantum mechanical distributions instead leads to a seraiclassical simulation. The important topic of choosing initial conditions is the subject of Section II.C. 

This picture is often refeired to as swarms of trajectories, and details are given in Appendix B. The nuclear problem is thus reduced to solving Newton s equations of motion for a number of different starting conditions. To connect... 

One way to overcome this problem is to start by setting up the ensemble of trajectories (or wavepacket) at the transition state. If these bajectories are then run back in time into the reactants region, they can be used to set up the distribution of initial conditions that reach the barrier. These can then be run forward to completion, that is, into the products, and by using transition state theory a reaction rate obtained [145]. These ideas have also been recently extended to non-adiabatic systems [146]. 

This behavior is consistent with experimental data. For high-frequency excitation, no fluorescence rise-time and a biexponential decay is seen. The lack of rise-time corresponds to a very fast internal conversion, which is seen in the trajectory calculation. The biexponential decay indicates two mechanisms, a fast component due to direct crossing (not seen in the trajectory calculation but would be the result for other starting conditions) and a slow component that samples the excited-state minima (as seen in the tiajectory). Long wavelength excitation, in contrast, leads to an observable rise time and monoexponential decay. This corresponds to the dominance of the slow component, and more time spent on the upper surface. 

The chaotic nature of individual MD trajectories has been well appreciated. A small change in initial conditions (e.g., a fraction of an Angstrom difference in Cartesian coordinates) can lead to exponentially-diverging trajectories in a relatively short time. The larger the initial difference and/or the timestep, the more rapid this Lyapunov instability. Fig. 1 reports observed behavior for the dynamics of a butane molecule. The governing Newtonian model is the following set of two first-order differential equations ... 

To exemplify both aspects of the formalism and for illustration purposes, we divide the present manuscript into two major parts. We start with calculations of trajectories using approximate solution of atomically detailed equations (approach B). We then proceed to derive the equations for the conditional probability from which a rate constant can be extracted. We end with a simple numerical example of trajectory optimization. More complex problems are (and will be) discussed elsewhere [7]. 

A related algorithm can be written also for the Brownian trajectory [10]. However, the essential difference between an algorithm for a Brownian trajectory and equation (4) is that the Brownian algorithm is not deterministic. Due to the existence of the random force, we cannot be satisfied with a single trajectory, even with pre-specified coordinates (and velocities, if relevant). It is necessary to generate an ensemble of trajectories (sampled with different values of the random force) to obtain a complete picture. Instead of working with an ensemble of trajectories we prefer to work with the conditional probability. I.e., we ask what is the probability that a trajectory being at... 

The definition of the above conditional probability for the case of Brownian trajectories can be found in textbooks [12], However, the definition of the conditional probability for the Newton s equations of motion is subtler than that. 

We use the sine series since the end points are set to satisfy exactly the three-point expansion [7]. The Fourier series with the pre-specified boundary conditions is complete. Therefore, the above expansion provides a trajectory that can be made exact. In addition to the parameters a, b and c (which are determined by Xq, Xi and X2) we also need to calculate an infinite number of Fourier coefficients - d, . In principle, the way to proceed is to plug the expression for X t) (equation (17)) into the expression for the action S as defined in equation (13), to compute the integral, and optimize the Onsager-Machlup action with respect to all of the path parameters. 

This is the conditional probability that the system which was in state A at time zero will be in state B at time t. Note that we use the normalized conditional probability since the trajectory must end either at A or at B. 

A single calculation of the discrete path integral with a fixed length of time t can be employed to compute the state conditional probability at many other times. It is possible to use segments of the path of time length At, 2At,..., NAt sampled in trajectories of total length of NAt and to compute the corresponding state conditional probabilities. The result of the calculations will make it possible to explore the exponential relaxation of P Ao B,t) for times between 0 and t. 

We further comment that reactive trajectories that successfully pass over large barriers are straightforward to compute with the present approach, which is based on boundary conditions. The task is considerably more difficult with initial value formulation. 

If the above assumption is reasonable, then the modeling of most probable trajectories and of ensembles of trajectories is possible. We further discussed the calculations of the state conditional probability and the connection of the conditional probability to rate constants and phenomenological models. 

It is appropriate to consider first the question of what kind of accuracy is expected from a simulation. In molecular dynamics (MD) very small perturbations to initial conditions grow exponentially in time until they completely overwhelm the trajectory itself. Hence, it is inappropriate to expect that accurate trajectories be computed for more than a short time interval. Rather it is expected only that the trajectories have the correct statistical properties, which is sensible if, for example, the initial velocities are randomly generated from a Maxwell distribution. 

---