In this paper, we present an efficient visibility-based algorithm for determining a locally exact shortest path (LESP) from a source point to a destination point on a (triangulated) polyhedral surface. Our algorithm, of a finitely-iterative scheme, evolves an initial approximately shortest path into a LESP. During each iteration, we first compute the exact shortest path restricted on the curren...

We consider the problem of interpolating scattered data using spline methods and present a general framework of using the multipole method to accelerate the evaluation of splines. The method depends on a tree-data structure and two hierarchical approximations: an upward multipole expansion approximation and a downward local Taylor series approximation. We also illustrate the performance of the ...

A new definition of the interaction list in the fast multipole method (FMM) is introduced in this paper, which can reduce the moment-to-local (M2L) translations by about 30-40% and therefore improve the efficiency for the FMM. In addition, an adaptive tree structure is investigated, which is potentially more efficient than the oct-tree structure for thin and slender domains as in the case of mi...

This paper presents a mixed basis approach for Laplace eigenvalue problems, which treats the boundary as a perturbation of the free Laplace operator. The method separates the boundary from the volume via a generic function that can be pre-calculated and thereby effectively reduces the complexity of the problem to a calculation over the surface. Several eigenvalues are retrieved simultaneously. ...

A numerical method for solving the equations modeling acoustic scattering in three dimensions is presented. The method is capable of handling several dozen scatterers, each of which is several wave-lengths long, on a personal work station. Even for geometries involving cavities, solutions accurate to seven digits or better were obtained. The method relies on a Boundary Integral Equation formula...

We develop an approximate algorithm to efficiently calculate the discrete Fourier transform on the rotation group SO(3). Our method needs O ( L3 logL log(1/ε) + log(1/ε)3Q ) arithmetic operations for a degree-L transform at Q nodes free of choice and with desired accuracy ε. Our main contribution is a method that allows to replace finite expansions in Wigner-d functions of arbitrary orders with...

The fast calculation of long-range interactions is a demanding problem in particle simulation. The main focus of our approach is the decomposition of the problem in building blocks and present efficient numerical realizations for these blocks. For that reason we recapitulate the fast Fourier transform at nonequispaced nodes and the fast summation method. We describe the application of these alg...

Non-uniform fast Fourier Transform (NUFFT) and inverse NUFFT (INUFFT) algorithms, based on the Fast Multipole Method (FMM) are developed and tested. Our algorithms are based on a novel factorization of the FFT kernel, and are implemented with attention to data structures and error analysis.

We review some recent results on multiwavelet methods for solving integral and partial differential equations and present an efficient representation of operators using discontinuous multiwavelet bases, including the case for singular integral operators. Numerical calculus using these representations produces fast O(N) methods for multiscale solution of integral equations when combined with low...

The fast multipole method (FMM) has had great success in reducing the computa4 tional complexity of solving the boundary integral form of the Helmholtz equation. We present a 5 formulation of the Helmholtz FMM that uses Fourier basis functions rather than spherical harmonics. 6 By modifying the transfer function in the precomputation stage of the FMM, time-critical stages of 7 the algorithm are...