pith. sign in

arxiv: 1907.08497 · v3 · pith:XPCWBOIXnew · submitted 2019-07-19 · ⚛️ physics.comp-ph · cond-mat.stat-mech· cs.NA· math.NA· physics.chem-ph

Accurate Sampling with Noisy Forces from Approximate Computing

classification ⚛️ physics.comp-ph cond-mat.stat-mechcs.NAmath.NAphysics.chem-ph
keywords computingapproximateaccelerationaccuratealgorithmicapplicationarithmeticatomistic
0
0 comments X
read the original abstract

In scientific computing, the acceleration of atomistic computer simulations by means of custom hardware is finding ever growing application. A major limitation, however, is that the high efficiency in terms of performance and low power consumption entails the massive usage of low-precision computing units. Here, based on the approximate computing paradigm, we present an algorithmic method to rigorously compensate for numerical inaccuracies due to low-accuracy arithmetic operations, yet still obtaining exact expectation values using a properly modified Langevin-type equation.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.