English
Related papers

Related papers: A Directional Equispaced interpolation-based Fast …

200 papers

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…

Numerical Analysis · Mathematics 2018-01-08 Austin R. Benson , Jack Poulson , Kenneth Tran , Björn Engquist , Lexing Ying

The fast multipole method (FMM) has had great success in reducing the computational complexity of solving the boundary integral form of the Helmholtz equation. We present a formulation of the Helmholtz FMM that uses Fourier basis functions…

Numerical Analysis · Mathematics 2014-03-20 Cris Cecka , Eric Darve

The boundary integral method is an efficient approach for solving time-harmonic acoustic obstacle scattering problems. The main computational task is the evaluation of an oscillatory boundary integral at each discretization point of the…

Numerical Analysis · Mathematics 2014-09-17 Lexing Ying

Fast multipole methods (FMM) were originally developed for accelerating $N$-body problems for particle-based methods. FMM is more than an $N$-body solver, however. Recent efforts to view the FMM as an elliptic Partial Differential Equation…

Numerical Analysis · Mathematics 2016-08-09 Huda Ibeid , Rio Yokota , David Keyes

We derive a Fast Multipole Method (FMM) where a low-rank approximation of the kernel is obtained using the Empirical Interpolation Method (EIM). Contrary to classical interpolation-based FMM, where the interpolation points and basis are…

Numerical Analysis · Mathematics 2015-08-25 Fabien Casenave

A fast multipole method (FMM) for asymptotically smooth kernel functions (1/r, 1/r^4, Gauss and Stokes kernels, radial basis functions, etc.) based on a Chebyshev interpolation scheme has been introduced in [Fong et al., 2009]. The method…

Numerical Analysis · Computer Science 2012-11-21 Matthias Messner , Bérenger Bramas , Olivier Coulaud , Eric Darve

In this paper, a highly efficient fast boundary element method (BEM) for solving large-scale engineering acoustic problems in a broad frequency range is developed and implemented. The acoustic problems are modeled by the Burton-Miller…

Numerical Analysis · Computer Science 2015-11-16 Yanchuang Cao , Lihua Wen , Jinyou Xiao , Yijun Liu

A highly efficient fast boundary element method (BEM) for solving large-scale engineering acoustic problems in a broad frequency range is developed and implemented. The acoustic problems are modeled by the Burton-Miller boundary integral…

Numerical Analysis · Computer Science 2015-11-16 Yanchuang Cao , Lihua Wen , Jinyou Xiao

An implementation of the fast multiple method (FMM) is performed for magnetic systems with long-ranged dipolar interactions. Expansion in spherical harmonics of the original FMM is replaced by expansion of polynomials in Cartesian…

Computational Physics · Physics 2015-05-13 Wen Zhang , Stephan Haas

In this paper, we propose a fast multipole method (FMM) for 3-D linearized Poisson-Boltzmann (PB) equation in layered media. The main framework of the algorithm is analogous to the FMM for Helmholtz and Laplace equation in layered media…

Numerical Analysis · Mathematics 2020-12-02 Bo Wang , Wen Zhong Zhang , Wei Cai

The meshless/meshfree radial basis function (RBF) method is a powerful technique for interpolating scattered data. But, solving large RBF interpolation problems without fast summation methods is computationally expensive. For RBF…

Numerical Analysis · Mathematics 2016-06-27 Wei Zhao , Martin Stoll

The Fast Multipole Method (FMM) provides a highly efficient computational tool for solving constant coefficient partial differential equations (e.g. the Poisson equation) on infinite domains. The solution to such an equation is given as the…

Numerical Analysis · Mathematics 2012-01-04 A. Gillman , P. G. Martinsson

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…

Numerical Analysis · Computer Science 2016-11-30 Nail A. Gumerov , Ramani Duraiswami

While fast multipole methods (FMMs) are in widespread use for the rapid evaluation of potential fields governed by the Laplace, Helmholtz, Maxwell or Stokes equations, their coupling to high-order quadratures for evaluating layer potentials…

Numerical Analysis · Mathematics 2021-04-26 Leslie Greengard , Michael O'Neil , Manas Rachh , Felipe Vico

We introduce the Fast Free Memory method (FFM), a new fast method for the numerical evaluation of convolution products. Inheriting from the Fast Multipole Method, the FFM is a descent-only and kernel-independent algorithm. We give the…

Numerical Analysis · Mathematics 2019-09-13 Matthieu Aussal , Marc Bakry

Algorithmic and architecture-oriented optimizations are essential for achieving performance worthy of anticipated energy-austere exascale systems. In this paper, we present an extreme scale FMM-accelerated boundary integral equation solver…

Performance · Computer Science 2018-03-28 Mustafa Abduljabbar , Mohammed Al Farhan , Noha Al-Harthi , Rui Chen , Rio Yokota , Hakan Bagci , David Keyes

The Fast Multipole Method (FMM) is well known to possess a bottleneck arising from decreasing workload on higher levels of the FMM tree [Greengard and Gropp, Comp. Math. Appl., 20(7), 1990]. We show that this potential bottleneck can be…

Computational Engineering, Finance, and Science · Computer Science 2010-08-17 Matthew G. Knepley

In this paper, we present a fast boundary integral method accelerated by the fast multipole method (FMM) for acoustic wave scattering governed by the scalar Helmholtz equation in multi-layered two-dimensional media. Multiple scatterers are…

Numerical Analysis · Mathematics 2025-11-18 Linfeng Xia , Heng Yuan , Bo Wang , Wei Cai

The kernel-independent fast multipole method (KIFMM) proposed in [1] is of almost linear complexity. In the original KIFMM the time-consuming M2L translations are accelerated by FFT. However, when more equivalent points are used to achieve…

Numerical Analysis · Computer Science 2015-03-19 Yanchuang Cao , Lihua Wen , Junjie Rong

Among optimal hierarchical algorithms for the computational solution of elliptic problems, the Fast Multipole Method (FMM) stands out for its adaptability to emerging architectures, having high arithmetic intensity, tunable accuracy, and…

Numerical Analysis · Computer Science 2016-01-20 Huda Ibeid , Rio Yokota , Jennifer Pestana , David Keyes
‹ Prev 1 2 3 10 Next ›