A fast algorithm for particle simulations
Journal of Computational Physics
A fast Poisson solver for complex geometries
Journal of Computational Physics
A direct adaptive Poisson solver of arbitrary order accuracy
Journal of Computational Physics
A Fast Poisson Solver of Arbitrary Order Accuracy in Rectangular Regions
SIAM Journal on Scientific Computing
A fast 3D Poisson solver of arbitrary order accuracy
Journal of Computational Physics
A Fast Spectral Solver for a 3D Helmholtz Equation
SIAM Journal on Scientific Computing
Parallel Adaptive Solution of a Poisson Equation with Multiwavelets
SIAM Journal on Scientific Computing
A Fast Spectral Subtractional Solver for Elliptic Equations
Journal of Scientific Computing
| Hi-index | 0.00 |
We present a Domain Decomposition non-iterative solver for the Poisson equation in a 3-D rectangular box. The solution domain is divided into mostly parallelepiped subdomains. In each subdomain a particular solution of the non-homogeneous equation is first computed by a fast spectral method. This method is based on the application of the discrete Fourier transform accompanied by a subtraction technique. For high accuracy the subdomain boundary conditions must be compatible with the specified inhomogeneous right hand side at the edges of all the interfaces. In the following steps the partial solutions are hierarchically matched. At each step pairs of adjacent subdomains are merged into larger units. In this paper we present the matching algorithm for two boxes which is a basis of the domain decomposition scheme. The hierarchical approach is convenient for parallelization and minimizes the global communication. The algorithm requires O(N3 log N) operations, where N is the number of grid points in each direction.