Return
A parallel fast multipole method for elliptic difference equations
DOI:10.1016/j.jcp.2014.07.048.png)
Abstract
En 中文
A new fast multipole formulation for solving elliptic difference equations on unbounded domains and its parallel implementation are presented. These difference equations can arise directly in the description of physical systems, e.g. crystal structures, or indirectly through the discretization of PDEs. In the analog to solving continuous inhomogeneous differential equations using Green's functions, the proposed method uses the fundamental solution of the discrete operator on an infinite grid, or lattice Green's function. Fast solutions O(N) are achieved by using a kernel-independent interpolation-based fast multipole method. Unlike other fast multipole algorithms, our approach exploits the regularity of the underlying Cartesian grid and the efficiency of FFTs to reduce the computation time. Our parallel implementation allows communications and computations to be overlapped and requires minimal global synchronization. The accuracy, efficiency, and parallel performance of the method are demonstrated through numerical experiments on the discrete 3D Poisson equation. (C) 2014 Elsevier Inc. All rights reserved.
Keywords:
Fast multipole method
Fast convolution
Difference equation
Green's function
Infinite domain
Parallel computing
Discrete operator
Elliptic solver
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.8
Papers:
1.6W
Citations:
7.4W
Organization
Cited Papers
Heptanuclear heterometallic Cu 5 Ln 2 (Ln = Gd, Tb) complexes: Synthesis, crystal structures, and magnetic properties studies
Polyhedron
IF0

