TY - JOUR
T1 - A Hierarchical 3-D Poisson Modified Fourier Solver by Domain Decomposition
AU - Israeli, Moshe
AU - Braverman, Elena
AU - Averbuch, Amir
PY - 2002/12
Y1 - 2002/12
N2 - 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.
AB - 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.
KW - 3-D Poisson solver
KW - Domain decomposition
KW - Modified Fourier method
UR - http://www.scopus.com/inward/record.url?scp=1942443192&partnerID=8YFLogxK
U2 - 10.1023/a:1015102109496
DO - 10.1023/a:1015102109496
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:1942443192
SN - 0885-7474
VL - 17
SP - 471
EP - 479
JO - Journal of Scientific Computing
JF - Journal of Scientific Computing
IS - 1-4
ER -