Basic HTML version of Foils prepared February 25 2000

Foil 12 Matrices and Graphs II

From Parallel Programming for Particle Dynamics Extra Foils Computational Science CPS615 -- Spring 2000 Semester. by Geoffrey C. Fox
1 Another way of looking at these problems is as graphs G where the nodes of the graphs are labeled by the particles i, and one has edges linking i to j if and only if the force Fij is non zero
2 In these languages, long range force problems correspond to dense matrix M (all elements nonzero) and fully connected graphs G
3 1
4 2
5 3
6 4
7 5
8 6
9 7
10 8
11 9
12 10
13 11
14 12
in Table To:

© Northeast Parallel Architectures Center, Syracuse University, npac@npac.syr.edu

If you have any comments about this server, send e-mail to webmaster@npac.syr.edu.

Page produced by wwwfoil on Wed Mar 1 2000