Repository logo

Infoscience

  • English
  • French
Log In
Logo EPFL, École polytechnique fédérale de Lausanne

Infoscience

  • English
  • French
Log In
  1. Home
  2. Academic and Research Output
  3. Journal articles
  4. Efficient sampling avoids the exponential wall in classical simulations of fidelity
 
research article

Efficient sampling avoids the exponential wall in classical simulations of fidelity

Mollica, Cesare  
•
Zimmermann, Tomas  
•
Vanicek, Jiri  
2011
Physical Review E

We analyze the efficiency of available algorithms for the simulation of classical fidelity and show that their computational costs increase exponentially with the number of degrees of freedom. Then we present an algorithm for which the number of trajectories needed for convergence is independent of the system's dimensionality and show that, within a continuous family of algorithms, this algorithm is the only one with this property. Simultaneously we propose a general analytical approach to estimate efficiency of trajectory-based methods and suggest how to use it to accelerate calculations of other classical correlation functions. Converged numerical results are provided for systems with phase space volume 2(1700) times larger than the volume of the initial state.

  • Files
  • Details
  • Metrics
Loading...
Thumbnail Image
Name

PhysRevE2011.pdf

Access type

openaccess

Size

199.17 KB

Format

Adobe PDF

Checksum (MD5)

7ef31e24204f2eabe4dea5b17c32cd02

Logo EPFL, École polytechnique fédérale de Lausanne
  • Contact
  • infoscience@epfl.ch

  • Follow us on Facebook
  • Follow us on Instagram
  • Follow us on LinkedIn
  • Follow us on X
  • Follow us on Youtube
AccessibilityLegal noticePrivacy policyCookie settingsEnd User AgreementGet helpFeedback

Infoscience is a service managed and provided by the Library and IT Services of EPFL. © EPFL, tous droits réservés