Big Chemical Encyclopedia

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

Articles Figures Tables About

World line algorithms

Quantum Monte Carlo World Line Algorithms.613... [Pg.592]

The worm algorithm [40] works in an extended configuration space, where in addition to closed world line configurations one open world line fragment (the worm ) is allowed. Formally this is done by adding a source term to the Hamiltonian which for a spin model is... [Pg.621]

In the second part we have given a short introduction and review of modern world line quantum Monte Carlo algorithms for quantum systems, which are free of any time discretization errors. We have highlighted the fact that... [Pg.635]

The general idea of the world-line Monte Carlo algorithm is similar to that of the quantum-to-classical mapping discussed in the last section. The Hamiltonian is split into two or more terms H = ft such that the matrix... [Pg.199]

Inserting complete sets of basis states between the different Hi factors then leads to a similar representation of the partition function and a similar world-line picture as in the world-line Monte Carlo method. Because there is no Trotter decomposition involved, the method is free of time discretization errors from the outset. Early applications of the SSE method employed local updates, but more efficient cluster-type updates have been developed more recently to overcome the critical slowing down. They include the operator-loop update and the previously mentioned directed-loop algorithm. ... [Pg.201]

To provide quantitative predictions about how to detect the superfluid-insulator transition in these experiments, Kashurnikov, Prokofev and Svistunov performed quantum Monte Carlo simulations of the singleparticle density matrix p,y = (I I /). They used the Bose-Hubbard model with harmonic confining potential and carried out world-line Monte Carlo simulations with the continuous-time Worm algorithm. The diagonal elements of the density matrix provide the real-space particle density, and... [Pg.207]

In many real-world applications, the isomorphism wotild be found before all 16 mappings were checked. For the example from Figure 6-3, many algorithms would find the isomorphism at the fourth mapping following the leftmost path in the search tree the bold line in Figure 6-4) ... [Pg.299]

Figure 9 A 6 yr time series of at nine time-series sites around the world. Values derived from the TOPEX algorithm are shown as a blue line, those from W92 as a green line, and those from LM86 as a red line (Glover et al., 2002) (reproduced hy permission of American Geophysical Union from Geophysical Monographs, 2002,... Figure 9 A 6 yr time series of at nine time-series sites around the world. Values derived from the TOPEX algorithm are shown as a blue line, those from W92 as a green line, and those from LM86 as a red line (Glover et al., 2002) (reproduced hy permission of American Geophysical Union from Geophysical Monographs, 2002,...

See other pages where World line algorithms is mentioned: [Pg.10]    [Pg.200]    [Pg.10]    [Pg.200]    [Pg.593]    [Pg.594]    [Pg.620]    [Pg.620]    [Pg.622]    [Pg.623]    [Pg.110]    [Pg.198]    [Pg.199]    [Pg.200]    [Pg.202]    [Pg.203]    [Pg.550]    [Pg.470]    [Pg.397]    [Pg.629]    [Pg.1]    [Pg.311]    [Pg.606]    [Pg.92]    [Pg.1196]    [Pg.310]    [Pg.516]    [Pg.1116]    [Pg.68]    [Pg.519]    [Pg.101]   
See also in sourсe #XX -- [ Pg.613 ]




SEARCH



World line

World-line Monte Carlo algorithm

© 2024 chempedia.info