The fast multiple algorithm (FMA), used to compute interactions between M bodies, can be used effectively in computing the electrostatic potential due to M bodies. A parallel FMA is combined with a capacitance solver. This implementation performs well and can be used in developing distributed memory implementations. Other advances include precomputation, multiprocessor scalability, and focus on data memory layout techniques.link_to_subscribed_fulltex
We present a set of benchmark problems involving conducting spheres and their solutions using a para...
We study integral methods applied to the resolution of the Maxwell equations where the linear system...
The fast multipole method is an algorithm first developed to approximately solve the N-body problem ...
In order to solve large mathematical formulations of real-life electromagnetic problems, we must use...
This thesis describes the Fast Multipole Method (FMM). The method reduces the complexity of the Coul...
AbstractThis paper presents a parallel version of the fast multipole method (FMM). The FMM is a rece...
The simulation of N-body system has been used extensively in biophysics and chemistry to investigate...
We present a 2.5-D Multilevel Fast Multipole Algorithm (MLFMA) that is capable of solving large and ...
The stratified medium fast multipole algorithm (SMFMA) is a fast integral equation method designed f...
An improved FMM algorithm to extract the capacitance matrix of multiple conductors in an environment...
A parallel implementation of the multilevel fast multipole algorithm (MLFMA) is developed for fast a...
In this paper, a new strategy for the parallelization of the multilevel fast multipole algorithm (ML...
Abstract—We present a parallel implementation of the multilevel fast multipole algorithm (MLFMA) for...
Fast and accurate solutions of large-scale electromagnetics problems involving homogeneous dielectri...
A number of physics problems can be modeled by a set of N elements which have pair-wise interactions...
We present a set of benchmark problems involving conducting spheres and their solutions using a para...
We study integral methods applied to the resolution of the Maxwell equations where the linear system...
The fast multipole method is an algorithm first developed to approximately solve the N-body problem ...
In order to solve large mathematical formulations of real-life electromagnetic problems, we must use...
This thesis describes the Fast Multipole Method (FMM). The method reduces the complexity of the Coul...
AbstractThis paper presents a parallel version of the fast multipole method (FMM). The FMM is a rece...
The simulation of N-body system has been used extensively in biophysics and chemistry to investigate...
We present a 2.5-D Multilevel Fast Multipole Algorithm (MLFMA) that is capable of solving large and ...
The stratified medium fast multipole algorithm (SMFMA) is a fast integral equation method designed f...
An improved FMM algorithm to extract the capacitance matrix of multiple conductors in an environment...
A parallel implementation of the multilevel fast multipole algorithm (MLFMA) is developed for fast a...
In this paper, a new strategy for the parallelization of the multilevel fast multipole algorithm (ML...
Abstract—We present a parallel implementation of the multilevel fast multipole algorithm (MLFMA) for...
Fast and accurate solutions of large-scale electromagnetics problems involving homogeneous dielectri...
A number of physics problems can be modeled by a set of N elements which have pair-wise interactions...
We present a set of benchmark problems involving conducting spheres and their solutions using a para...
We study integral methods applied to the resolution of the Maxwell equations where the linear system...
The fast multipole method is an algorithm first developed to approximately solve the N-body problem ...