Algorithm constructing Hamiltonian

Finally, algorithms have been developed which incorporate electron correlation effects explicitly in wave function based band theory for crystalline solids [16, 17]. These algorithms construct the many-electron Hamiltonian matrix for a periodic system by extracting the matrix elements from calculations on finite embedded clusters. In this way the incorporation of correlation effects leads to many-electron energy bands, not only associated with hole states and added-electron states but also with excited states. More recently, Pisani and co-workers [18] introduced a post-Hartree-Fock program based on periodic local second order Mpller-Plesset perturbation theory. 

The construction of an efficient algorithm rests on the ability to separate the Hamiltonian into parts which are themselves integrable and also efficiently computable. Suppose that the MD Hamiltonian H defined by (6) is split into two parts as... 

We demonstrated that by the selection of a representation of the Dirac Hamiltonian in the spinor space one may strongly influence the performance of the variational principle. In a vast majority of implementations the standard Pauli representation has been used. Consequently, computational algorithms developed in relativistic theory of many-electron systems have been constructed so that they are applicable in this representation only. The conditions, under which the results of these implementations are reliable, are very well understood and efficient numerical codes are available for both atomic and molecular calculations (see e.g. [16]). However, the representation of Weyl, if the external potential is non-spherical, or the representation of Biedenharn, in spherically-symmetric cases, seem to be attractive and, so far, hardly explored options. 

However, a Cl hamiltonian matrix have eigenvalues spread out in a very wide range, and this reduces the value of the Lanczos algorithm for Cl purposes. Attempts have been made to precondition the Lanczos procedure, such that the iterations are governed by a clustered matrix while at the same time a stable subspace of the original matrix is constructed. The success of such a scheme has yet to be demonstrated. 

In this section we will develop the phase-space structure for a broad class of n-DOF Hamiltonian systems that are appropriate for the study of reaction dynamics through a rank-one saddle. For this class of systems we will show that on the energy surface there is always a higher-dimensional version of a saddle (an NHIM [22]) with codimension one (i.e., with dimensionality one less than the energy surface) stable and unstable manifolds. Within a region bounded by the stable and unstable manifolds of the NHIM, we can construct the TS, which is a dynamical surface of no return for the trajectories. Our approach is algorithmic in nature in the sense that we provide a series of steps that can be carried out to locate the NHIM, its stable and unstable manifolds, and the TS, as well as describe all possible trajectories near it. 

Finally, as an example of a more empirical application, we draw attention to the vector and parallel FCI algorithm of Bendazzoli and Evangelisti.i The algorithm described was integral driven and was based on the explicit construction of tables that realized the correspondence between the FCI vector x and the product vector Hx, H being the Hamiltonian matrix of the system. In this way no decomposition of the identity was needed, and in the simplest implementation only the two vectors x and Hx need to be stored on disk. The main test was... 

In this subsection we will combine the general ideas of the iterative perturbation algorithms by unitary transformations and the rotating wave transformation, to construct effective models. We first show that the preceding KAM iterative perturbation algorithms allow us to partition at a desired order operators in orthogonal Hilbert subspaces. Its relation with the standard adiabatic elimination is proved for the second order. We next apply this partitioning technique combined with RWT to construct effective dressed Hamiltonians from the Floquet Hamiltonian. This is illustrated in the next two Sections III.E and III.F for two-photon resonant processes in atoms and molecules. 

As successful as the loop algorithm is, it is restricted - as most classical cluster algorithms - to models with spin inversion symmetry. Terms in the Hamiltonian which break this spin-inversion symmetry, such as a magnetic field, are not taken into account during loop construction. Instead they enter through the acceptance rate of the loop flip, which can be exponentially small at low temperatures. 

Several efficient algorithms have been suggested for obtaining variational solutions to vibrational Hamiltonians such as Hj (20-22). Generally for triatomic systems, the time taken to construct the secular matrix is dwarfed by that required to obtain the eigenvalues and eigenvectors... 

---