Name
Abstract | ||
|---|---|---|
We introduce a fast mesh-based method for computing N-body interactions that is both scalable and accurate. The method is founded on a particle-particle--particle-mesh P3M approach, which decomposes a potential into rapidly decaying short-range interactions and smooth, mesh-resolvable long-range interactions. However, in contrast to the traditional approach of using Gaussian screen functions to accomplish this decomposition, our method employs specially designed polynomial bases to construct the screened potentials. Because of this form of the screen, the long-range component of the potential is then solved exactly with a finite element method, leading ultimately to a sparse matrix problem that is solved efficiently with standard multigrid methods. Moreover, since this system represents an exact discretization, the optimal resolution properties of the FFT are unnecessary, though the short-range calculation is now more involved than P3M/PME methods. We introduce the method, analyze its key properties, and demonstrate the accuracy of the algorithm. |
Year | Venue | Field |
|---|---|---|
2015 | SIAM J. Scientific Computing | Discretization,Mathematical optimization,Polynomial,Extended finite element method,Algorithm,Finite element method,Fast Fourier transform,Multigrid method,Mathematics,Sparse matrix,Mixed finite element method |
DocType | Volume | Issue |
Journal | abs/1503.08509 | 3 |
Citations | PageRank | References |
1 | 0.43 | 7 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Natalie N. Beams | 1 | 1 | 0.77 |
| Luke Olson | 2 | 235 | 21.93 |
| Jonathan B. Freund | 3 | 1 | 0.43 |