Numerical Replication of Computer Simulations: Some Pitfalls and How To Avoid Them

01/26/2000
by   Theodore C. Belding, et al.
0

A computer simulation, such as a genetic algorithm, that uses IEEE standard floating-point arithmetic may not produce exactly the same results in two different runs, even if it is rerun on the same computer with the same input and random number seeds. Researchers should not simply assume that the results from one run replicate those from another but should verify this by actually comparing the data. However, researchers who are aware of this pitfall can reliably replicate simulations, in practice. This paper discusses the problem and suggests solutions.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/06/2022

Genetic algorithm formulation and tuning with use of test functions

This work discusses single-objective constrained genetic algorithm with ...
research
12/04/2020

Revisiting "What Every Computer Scientist Should Know About Floating-point Arithmetic"

The differences between the sets in which ideal arithmetics takes place ...
research
05/30/2021

A Tapered Floating Point Extension for the Redundant Signed Radix 2 System Using the Canonical Recoding

A tapered floating point encoding is proposed which uses the redundant s...
research
06/14/2019

Exact arithmetic as a tool for convergence assessment of the IRM-CG method

Using exact computer arithmetic, it is possible to determine the (exact)...
research
06/03/2021

When does the Lanczos algorithm compute exactly?

In theory, the Lanczos algorithm generates an orthogonal basis of the co...
research
07/15/2022

An Exact Bitwise Reversible Integrator

At a fundamental level most physical equations are time reversible. In t...

Please sign up or login with your details

Forgot password? Click here to reset