Classes of Particle Problems
If the range r is small (as in a crystal), the one gets numerical formulations and parallel computing considerations similar to those in Laplace example with local communication
- We showed in Laplace module that efficiency increases as range of force increases
If r is infinite ( no cut-off for force) as in gravitational problem, one finds rather different issues which we will discuss in this module
There are several “non-particle” problems discussed later that reduce to long range force problem characterized by every entity interacting with every other entity
- Characterized by a calculation where updating entity i involves all other entities j