Volume 2, 2007

Download This Article
with up-to-date links in citations
Download this article. For Screen
For Printing
Recent Issues
Volume 1
Volume 2
Volume 3
The Journal
Cover
Editorial Board
About the Journal
Scientific Advantages
How to best view CAMCoS
Submission Guidelines
Upload Page
Subscriptions
Test your IP address
Editorial Login
Contacts

Peter McCorquodale & Phillip Colella & Gregory T. Balls & Scott B. Baden

Abstract

We present a second-order accurate algorithm for solving the free-space Poisson’s equation on a locally-refined nested grid hierarchy in three dimensions. Our approach is based on linear superposition of local convolutions of localized charge distributions, with the nonlocal coupling represented on coarser grids. The representation of the nonlocal coupling on the local solutions is based on Anderson’s Method of Local Corrections and does not require iteration between different resolutions. A distributed-memory parallel implementation of this method is observed to have a computational cost per grid point less than three times that of a standard FFT-based method on a uniform grid of the same resolution, and scales well up to 1024 processors.

Keywords

Poisson's equation, local corrections, domain decomposition, adaptive mesh refinement

Authors
Peter McCorquodale
Lawrence Berkeley National Laboratory
1 Cyclotron Road, MS 50A-1148
Berkeley, CA 94720
United States
Phillip Colella
Lawrence Berkeley National Laboratory
1 Cyclotron Road, MS 50A-1148
Berkeley, CA 94720
United States
Gregory T. Balls
Center for Scientific Computation in Imaging
University of California, San Diego
9500 Gilman Drive # 0854
La Jolla, CA 92093-0854
United States
Scott B. Baden
Department of Computer Science and Engineering
University of California, San Diego
9500 Gilman Drive
La Jolla, CA 92093-0114
United States