Author

# J W Eastwood

Bio: J W Eastwood is an academic researcher from University of Reading. The author has contributed to research in topics: Fourier transform & Fourier series. The author has an hindex of 4, co-authored 6 publications receiving 7619 citations.

##### Papers

More filters

•

[...]

TL;DR: In this paper, a simulation program for particle-mesh force calculation is presented, based on a one-dimensional plasma model and a collisionless particle model, which is used to simulate collisionless particle models.

Abstract: Computer experiments using particle models A one-dimensional plasma model The simulation program Time integration schemes The particle-mesh force calculation The solution of field equations Collisionless particle models Particle-particle/particle-mesh algorithms Plasma simulation Semiconductor device simulation Astrophysics Solids, liquids and phase changes Fourier transforms Fourier series and finite Fourier transforms Bibliography Index

6,376 citations

[...]

TL;DR: Computer experiments using particle models A one-dimensional plasma model The simulation program Time integration schemes The particle-mesh force calculation The solution of field equations Collisionless particle models Particle-particles/particle/particles algorithms Plasma simulation Semiconductor device simulation Astrophysics

Abstract: Computer experiments using particle models A one-dimensional plasma model The simulation program Time integration schemes The particle-mesh force calculation The solution of field equations Collisionless particle models Particle-particle/particle-mesh algorithms Plasma simulation Semiconductor device simulation Astrophysics Solids, liquids and phase changes Fourier transforms Fourier series and finite Fourier transforms Bibliography Index

1,372 citations

##### Cited by

More filters

••

[...]

TL;DR: In this article, three parallel algorithms for classical molecular dynamics are presented, which can be implemented on any distributed-memory parallel machine which allows for message-passing of data between independently executing processors.

Abstract: Three parallel algorithms for classical molecular dynamics are presented. The first assigns each processor a fixed subset of atoms; the second assigns each a fixed subset of inter-atomic forces to compute; the third assigns each a fixed spatial region. The algorithms are suitable for molecular dynamics models which can be difficult to parallelize efficiently—those with short-range forces where the neighbors of each atom change rapidly. They can be implemented on any distributed-memory parallel machine which allows for message-passing of data between independently executing processors. The algorithms are tested on a standard Lennard-Jones benchmark problem for system sizes ranging from 500 to 100,000,000 atoms on several parallel supercomputers--the nCUBE 2, Intel iPSC/860 and Paragon, and Cray T3D. Comparing the results to the fastest reported vectorized Cray Y-MP and C90 algorithm shows that the current generation of parallel machines is competitive with conventional vector supercomputers even for small problems. For large problems, the spatial algorithm achieves parallel efficiencies of 90% and a 1840-node Intel Paragon performs up to 165 faster than a single Cray C9O processor. Trade-offs between the three algorithms and guidelines for adapting them to more complex molecular dynamics simulations are also discussed.

32,670 citations

••

[...]

TL;DR: In this paper, a method is described to realize coupling to an external bath with constant temperature or pressure with adjustable time constants for the coupling, which can be easily extendable to other variables and to gradients, and can be applied also to polyatomic molecules involving internal constraints.

Abstract: In molecular dynamics (MD) simulations the need often arises to maintain such parameters as temperature or pressure rather than energy and volume, or to impose gradients for studying transport properties in nonequilibrium MD A method is described to realize coupling to an external bath with constant temperature or pressure with adjustable time constants for the coupling The method is easily extendable to other variables and to gradients, and can be applied also to polyatomic molecules involving internal constraints The influence of coupling time constants on dynamical variables is evaluated A leap‐frog algorithm is presented for the general case involving constraints with coupling to both a constant temperature and a constant pressure bath

25,256 citations

[...]

TL;DR: Comparing the results to the fastest reported vectorized Cray Y-MP and C90 algorithm shows that the current generation of parallel machines is competitive with conventional vector supercomputers even for small problems.

Abstract: Three parallel algorithms for classical molecular dynamics are presented. The first assigns each processor a fixed subset of atoms; the second assigns each a fixed subset of inter-atomic forces to compute; the third assigns each a fixed spatial region. The algorithms are suitable for molecular dynamics models which can be difficult to parallelize efficiently—those with short-range forces where the neighbors of each atom change rapidly. They can be implemented on any distributed-memory parallel machine which allows for message-passing of data between independently executing processors. The algorithms are tested on a standard Lennard-Jones benchmark problem for system sizes ranging from 500 to 100,000,000 atoms on several parallel supercomputers--the nCUBE 2, Intel iPSC/860 and Paragon, and Cray T3D. Comparing the results to the fastest reported vectorized Cray Y-MP and C90 algorithm shows that the current generation of parallel machines is competitive with conventional vector supercomputers even for small problems. For large problems, the spatial algorithm achieves parallel efficiencies of 90% and a 1840-node Intel Paragon performs up to 165 faster than a single Cray C9O processor. Trade-offs between the three algorithms and guidelines for adapting them to more complex molecular dynamics simulations are also discussed.

24,496 citations

••

[...]

TL;DR: An N⋅log(N) method for evaluating electrostatic energies and forces of large periodic systems is presented based on interpolation of the reciprocal space Ewald sums and evaluation of the resulting convolutions using fast Fourier transforms.

Abstract: An N⋅log(N) method for evaluating electrostatic energies and forces of large periodic systems is presented. The method is based on interpolation of the reciprocal space Ewald sums and evaluation of the resulting convolutions using fast Fourier transforms. Timings and accuracies are presented for three large crystalline ionic systems.

20,639 citations

••

[...]

TL;DR: It is demonstrated that arbitrary accuracy can be achieved, independent of system size N, at a cost that scales as N log(N), which is comparable to that of a simple truncation method of 10 A or less.

Abstract: The previously developed particle mesh Ewald method is reformulated in terms of efficient B‐spline interpolation of the structure factors This reformulation allows a natural extension of the method to potentials of the form 1/rp with p≥1 Furthermore, efficient calculation of the virial tensor follows Use of B‐splines in place of Lagrange interpolation leads to analytic gradients as well as a significant improvement in the accuracy We demonstrate that arbitrary accuracy can be achieved, independent of system size N, at a cost that scales as N log(N) For biomolecular systems with many thousands of atoms this method permits the use of Ewald summation at a computational cost comparable to that of a simple truncation method of 10 A or less

17,897 citations