Results 11 to 20 of about 28,156 (165)
An efficient 2-D MLFMM-UTD hybrid method to model non-line-of-sight propagation [PDF]
, 2015 We present a hybrid method that combines the Multilevel Fast Multipole Method (MLFMM) with the Uniform Theory of Diffraction (UTD) to model two-dimensional (2-D) scattering problems.
De Zutter, Daniël +2 more
core +1 more source
A parallel fast multipole method for elliptic difference equations [PDF]
, 2014 A new fast multipole formulation for solving elliptic difference equations on unbounded domains and its parallel implementation are presented. These difference equations can arise directly in the description of physical systems, e.g.
Colonius, Tim, Liska, Sebastian
core +1 more source
Fast algorithms for Quadrature by Expansion I: Globally valid expansions
, 2017 The use of integral equation methods for the efficient numerical solution of PDE boundary value problems requires two main tools: quadrature rules for the evaluation of layer potential integral operators with singular kernels, and fast algorithms for ...
Klöckner, Andreas +2 more
core +1 more source
On well-separated sets and fast multipole methods
, 2011 The notion of well-separated sets is crucial in fast multipole methods as the main idea is to approximate the interaction between such sets via cluster expansions.
Engblom, Stefan
core +1 more source
A cholesky-based SGM-MLFMM for stochastic full-wave problems described by correlated random variables [PDF]
, 2016 In this letter, the multilevel fast multipole method (MLFMM) is combined with the polynomial chaos expansion (PCE)-based stochastic Galerkin method (SGM) to stochastically model scatterers with geometrical variations that need to be described by a set of
Daniel, Luca +3 more
core +2 more sources
The Fast Multipole Method: Numerical Implementation [PDF]
Journal of Computational Physics, 2000 The paper studies algorithmic problems and computational aspects for solving integral equations for electromagnetic scattering problems with the fast multipole method. The paper analyses several techniques to reduce the complexity constant of the method and provides impressive numerical results.
openaire +1 more source
Fourier Based Fast Multipole Method for the Helmholtz Equation
, 2011 The fast multipole method (FMM) has had great success in reducing the computational complexity of solving the boundary integral form of the Helmholtz equation.
Cecka, Cris, Darve, Eric
core +1 more source
The use of curl-conforming basis functions for the magnetic-field integral equation [PDF]
, 2006 Cataloged from PDF version of article.Divergence-conforming Rao-Wilton-Glisson (RWG) functions are commonly used in integral-equation formulations to model the surface current distributions on planar triangulations.
Ergul, O., Gurel, L.
core +1 more source
Scalable Distributed Fast Multipole Methods [PDF]
2012 IEEE 14th International Conference on High Performance Computing and Communication & 2012 IEEE 9th International Conference on Embedded Software and Systems, 2012 The Fast Multipole Method (FMM) allows $O(N)$ evaluation to any arbitrary precision of $N$-body interactions that arises in many scientific contexts. These methods have been parallelized, with a recent set of papers attempting to parallelize them on heterogeneous CPU/GPU architectures \cite{Qi11:SC11}.
Qi Hu +2 more
openaire +1 more source
Data‐driven execution of fast multipole methods [PDF]
Concurrency and Computation: Practice and Experience, 2013 SUMMARYFast multipole methods (FMMs) havecomplexity, are compute bound, and require very little synchronization, which makes them a favorable algorithm on next‐generation supercomputers. Their most common application is to accelerateN‐body problems, but they can also be used to solve boundary integral equations.
Hatem Ltaief, Rio Yokota
openaire +3 more sources