1994
DOI: 10.1142/s0129053394000202
|View full text |Cite
|
Sign up to set email alerts
|

Lagged Fibonacci Series Random Number Generators for the Nec Sx-3

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
20
0

Year Published

1998
1998
2019
2019

Publication Types

Select...
4
3
1

Relationship

0
8

Authors

Journals

citations
Cited by 25 publications
(21 citation statements)
references
References 3 publications
1
20
0
Order By: Relevance
“…To check carefully the accuracy of the methods up to small time steps, we need to drastically reduce the Monte-Carlo error. We thus approximate the required moments of the numerical solutions by averages over 500 millions of trajectories computed in fortran, using the random number generator [35]. For a fair comparison, notice that we use the same set of random numbers for each numerical integrator.…”
Section: 13mentioning
confidence: 99%
“…To check carefully the accuracy of the methods up to small time steps, we need to drastically reduce the Monte-Carlo error. We thus approximate the required moments of the numerical solutions by averages over 500 millions of trajectories computed in fortran, using the random number generator [35]. For a fair comparison, notice that we use the same set of random numbers for each numerical integrator.…”
Section: 13mentioning
confidence: 99%
“…We integrate (6.44) numerically using the standard fourth-order Runge-Kutta method with a constant integration step t [37] and the lagged Fibonacci random number generator [43]. The delta-function is represented numerically as ı.t/ D 0 for jt j > t=2 and ı.t/ D 1=t for jt j < t=2, i.e., the numerical integration step corresponds to the correlation time of the random force.…”
Section: Topological Solitons In Crystalline Pementioning
confidence: 99%
“…The advantage (on a machine with slow floatingpoint multiplication) is that multiplication of a 4-vector by A 1 requires only seven additions and one division by two (for details see [38, §2.1]). The inner loop of the implementation is similar to the inner loop for the popular "generalised Fibonacci" uniform random number generators [3,7,15,16,21,23,31,33]. Wallace's implementation of fastnorm on a RISC workstation is about as fast as a good uniform random number generator on the same workstation.…”
Section: Cost Of Transformationsmentioning
confidence: 99%