Path: utzoo!utgpu!watmath!clyde!att!osu-cis!tut.cis.ohio-state.edu!rutgers!deimos!uxc!uxc.cso.uiuc.edu!mcdurb!aglew From: aglew@mcdurb.Urbana.Gould.COM Newsgroups: comp.arch Subject: Re: Seeing the future Message-ID: <28200245@mcdurb> Date: 27 Nov 88 19:35:00 GMT References: <1984@eos.UUCP> Lines: 14 Nf-ID: #R:eos.UUCP:1984:mcdurb:28200245:000:631 Nf-From: mcdurb.Urbana.Gould.COM!aglew Nov 27 13:35:00 1988 The new O(n) algorithm for the n-body problem is described in An ACM Distinguished Dissertation - 1987, published by MIT Press: The Rapid Evaluation of Potential Fields in Particle Systems, Leslie F. Greengard, ISBN 0-262-07110-X. I am excited because a friend was parallelizing the previously best known algorithm for the n-body problem, Piers and Hutt's oct-tree O(n lg n) algorithm, and he was obtaining impressive speedups (it's amazing what a difference a professional programmer can make). I am excited because many of the applications supercomputers are used to investigate are, in fact, varieties of the n-body problem.