Abstract
We present an adaptive fast multipole method for solving the Poisson equation in two dimensions. The algorithm is direct, assumes that the source distribution is discretized using an adaptive quad-tree, and allows for Dirichlet, Neumann, periodic, and free-space conditions to be imposed on the boundary of a square. The amount of work per grid point is comparable to that of classical fast solvers, even for highly nonuniform grids.
Original language | English (US) |
---|---|
Pages (from-to) | 741-760 |
Number of pages | 20 |
Journal | SIAM Journal on Scientific Computing |
Volume | 23 |
Issue number | 3 |
DOIs | |
State | Published - 2002 |
Keywords
- Adaptive refinement
- Fast Poisson solver
- Fast multipole method
- Poisson equation
ASJC Scopus subject areas
- Computational Mathematics
- Applied Mathematics