A Parallel Directional Fast Multipole Method
TL;DR: In this article, a parallel directional fast multipole method (FMM) was proposed for solving the Helmholtz kernel in three dimensions with a more restrictive low-rank criterion than that of the low-frequency regime.
read more
Abstract: This paper introduces a parallel directional fast multipole method (FMM) for solving $N$-body problems with highly oscillatory kernels, with a focus on the Helmholtz kernel in three dimensions. This class of oscillatory kernels requires a more restrictive low-rank criterion than that of the low-frequency regime, and thus effective parallelizations must adapt to the modified data dependencies. We propose a simple partition at a fixed level of the octree and show that, if the partitions are properly balanced between $p$ processes, the overall runtime is essentially $\mathcal{O}{N \log N/p + p}$. By the structure of the low-rank criterion, we are able to avoid communication at the top of the octree. We demonstrate the effectiveness of our parallelization on several challenging models.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Parallel Wideband MLFMA for Analysis of Electrically Large, Nonuniform, Multiscale Structures
S. Hughey,Hasan Metin Aktulga,Melapudi Vikram,Mingyu Lu,Balasubramaniam Shanker,Eric Michielssen +5 more
TL;DR: The accuracy (with respect to analytical data) and performance of the algorithm for both PEC scatterers and point clouds as large as $755{\lambda$ with several hundred million unknowns and nonuniform trees as deep as 16 levels are demonstrated.
17
Fast Inverse Design of 3D Nanophotonic Devices Using Boundary Integral Methods
TL;DR: In this article , a 3D simulation and boundary-based optimization framework for nanophotonic devices based on boundary integral methods has been proposed, which achieves high accuracy even at coarse mesh discretizations while only requiring modest computational resources.
11
•Posted Content
Parallel finite volume simulation of the spherical shell dynamo with pseudo-vacuum magnetic boundary conditions.
TL;DR: This paper studies the parallel simulation of the magnetohydrodynamic (MHD) dynamo in a rapidly rotating spherical shell with pseudo-vacuum magnetic boundary conditions and adopts a widely-used approach whereby a pseudo-pressure is introduced into the induction equation.
5
References
Some methods for classification and analysis of multivariate observations
James B. MacQueen
- 01 Jan 1967
TL;DR: The k-means algorithm as mentioned in this paper partitions an N-dimensional population into k sets on the basis of a sample, which is a generalization of the ordinary sample mean, and it is shown to give partitions which are reasonably efficient in the sense of within-class variance.
•Book
Inverse Acoustic and Electromagnetic Scattering Theory
David Colton,Rainer Kress +1 more
- 01 Jan 1992
TL;DR: Inverse Medium Problem (IMP) as discussed by the authors is a generalization of the Helmholtz Equation for direct acoustical obstacle scattering in an Inhomogeneous Medium (IMM).
5.7K
•Book
Fast and Efficient Algorithms in Computational Electromagnetics
Weng Cho Chew,Eric Michielssen,Jiming Song,Jian-Ming Jin +3 more
- 01 Jul 2001
TL;DR: The book introduces you to new advances in the perfectly matched layer absorbing boundary conditions, and offers a thorough understanding of error analysis of numerical methods, fast-forward and inverse solvers for inverse problems, hybridization in computational electromagnetics, and asymptotic waveform evaluation.
2.1K
Multilevel fast multipole algorithm for electromagnetic scattering by large complex objects
TL;DR: Using these techniques, the FMM and MLFMA can solve the problem of electromagnetic scattering by large complex three-dimensional objects such as an aircraft on a small computer.
1.7K
Optimization of Collective Communication Operations in MPICH
Rajeev Thakur,Rolf Rabenseifner,William Gropp +2 more
- 01 Feb 2005
TL;DR: The work on improving the performance of collective communication operations in MPICH is described, with results indicating that to achieve the best performance for a collective communication operation, one needs to use a number of different algorithms and select the right algorithm for a particular message size and number of processes.