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 use of graphics processing units for scientific computations is an emerging strategy that
can significantly speed up various algorithms. In this review, we discuss advances made in …

This paper proposes a fast time-domain boundary element method (TDBEM) to solve three-
dimensional transient electromagnetic scattering problems regarding perfectly electric …

High performance fast multipole method is crucial for the numerical simulation of many
physical problems. In a previous study, we have shown that task‐based fast multipole …

We fundamentally reconsider implementation of the Fast Multipole Method (FMM) on a
computing node with a heterogeneous CPU-GPU architecture with multicore CPU (s) and …

We investigate an efficient preconditioning of iterative methods (such as GMRES) for solving
dense linear systems A x= b that follow from a boundary element method (BEM) for the 3D …

There has been a large increase in the amount of work on hierarchical low-rank
approximation methods, where the interest is shared by multiple communities that previously …

We consider the isogeometric analysis for fractional PDEs involving the fractional Laplacian
in two dimensions. An isogeometric collocation method is developed to discretize the …

In order to accelerate fast multipole boundary element method (FMBEM), in terms of the
intrinsic parallelism of boundary elements and the FMBEM tree structure, a series of CUDA …

We present an algorithm to parallelize the inverse fast multipole method (IFMM), which is an
approximate direct solver for dense linear systems. The parallel scheme is based on a …