[comp.parallel] A Fast Algorithm for the Many-Body Problem

SALZMAN@pucc.princeton.edu (David Salzman) (01/07/89)

           The John von Neumann National Supercomputer Center
                          665 College Road East
                Princeton Forrestal Center, Plainsboro NJ


              "A Fast Algorithm for the Many-Body Problem"

                           Vladimir Rokhlin
                            Yale University
                      4:00 pm, Friday, January 6


The speaker will present the fastest algorithm known for evaluating potential
fields in large systems of particles.  Unlike previous methods, the algorithm
has an asymptotic cpu time which scales linearly with the number of particles
in the system, and does not depend on the statistics of the distribution.
Performance will be illustrated by numerical examples drawn from celestial
mechanics, plasma simulation, molecular dynamics, solutions of the Laplace
equation, and numerical complex analysis.

Vladimir Rokhlin was educated as an algebraic topologist in Leningrad, Russia
and in Vilnius, Lithuania.  He received his Ph.D. in applied mathematics from
Rice University in Houston before emigrating to Yale University in 1985.


  Open to the public.  Refreshments will be served at 3:40 PM.
  For information about the seminar or directions to the Center,
  contact <SCIENCE@JVNCD.BITNET> or call 609/520-2000.
  Reservations are not needed.