We present new scalable algorithms and a new implementation of our kernel-independent
fast multipole method (Ying et al. ACM/IEEE SC'03), in which we employ both distributed …

The development of the multilevel fast multipole algorithm (MLFMA) and its multiscale
variants have enabled the use of integral equation (IE) based solvers to compute scattering …

In this paper, we develop a parallel Fast Multipole Method (FMM) based solution for
computing the scattered electromagnetic fields from a Perfect Electrically Conducting (PEC) …

We present faster sequential and parallel algorithms for computing the solvent accessible
surface area (ASA) of protein molecules. The ASA is computed by finding the exposed …

Accumulations are abstract operations on trees useful in many applications involving trees.
The upward accumulation problem is to aggregate data in the subtree under each node of …

The emergence of cloud computing and Google's MapReduce paradigm is renewing
interest in the development of broadly applicable high level abstractions as a means to …

We have performed a detailed analysis of the fast multipole method (FMM) in the adaptive
case, in which the depth of the FMM tree is nonuniform. Previous works in this area have …

This thesis consists in a topological and cohomological study of rings of algebraic integers.
In the first part, we define an equivariant étale cohomology theory, which satisfies a …

The Coulomb interaction between charged particles inside a bunch is one of the most
important collective effects in the study of beam dynamics. As scientists try to approach …

Rapid evaluation of potentials in large physical systems plays a crucial role in several fields
and has been an intensely studied topic on parallel computers. Computational methods and …