The Complexity of N-body Simulation

The n-body simulation problem is stated as follows: Given initial positions and velocities of n particles that have pair-wise force interactions, simulate the movement of these particles so as to determine the positions of the particles at a future time.

[1]  R W Hockney,et al.  Computer Simulation Using Particles , 1966 .

[2]  Walter J. Savitch,et al.  Relationships Between Nondeterministic and Deterministic Tape Complexities , 1970, J. Comput. Syst. Sci..

[3]  J. Douglas Faires,et al.  Numerical Analysis , 1981 .

[4]  T. Toffoli,et al.  Conservative logic , 2002, Collision-Based Computing.

[5]  V. Rokhlin,et al.  Rapid Evaluation of Potential Fields in Three Dimensions , 1988 .

[6]  L Greengard,et al.  On the Efficient Implementation of the Fast Multipole Algorithm. , 1988 .

[7]  J. Doug Tygar,et al.  The computability and complexity of optical beam tracing , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[8]  M. Karplus,et al.  Molecular dynamics simulations in biology , 1990, Nature.

[9]  Moore,et al.  Unpredictability and undecidability in dynamical systems. , 1990, Physical review letters.

[10]  Jacob K. White,et al.  FastCap: a multipole accelerated 3-D capacitance extraction program , 1991, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..