Results 1  10
of
707,093
Parallel Fast Multipole Algorithm using MPI
 In the proceedings of MPI Developers Conference
, 1995
"... The simulation of manybody, manyparticle system has a wide range of applications in area such as biophysics, chemistry, astrophysics, etc. It is known that the force calculation contributes ninety percent of the simulation time. This is mainly due to the fact that the total number of interactions ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
in the force is O(N 2 ), where N is the number of particles in the system. The fast multipole algorithm, proposed by Greengard and Rokhlin, reduces the time complexity of the force calculation to O(N ). We implement the fast multipole algorithm, using MPI, based on optimal communication scheme which
Inplementation of an Efficient Parallel Multilevel Fast Multipole Algorithm
"... Abstract—This paper is concerned with the implementation of the parallel multilevel fast multipole algorithm(MLFMA) for large scale electromagnetics simulation on sharedmemory system. The algorithm is implemented on a method of moment discretisation of the electromagnetics scattering problems.The d ..."
Abstract
 Add to MetaCart
Abstract—This paper is concerned with the implementation of the parallel multilevel fast multipole algorithm(MLFMA) for large scale electromagnetics simulation on sharedmemory system. The algorithm is implemented on a method of moment discretisation of the electromagnetics scattering problems
The Fast Multipole Algorithm on the Cell Broadband Engine Architecture
"... Computing the interactions between N particles due to electrostatic or gravitational forces is a well known problem in scienti�c computing. Known as the Nbody problem, it is a well known setback in scienti�c computing. Typical applications of the simulation, such as simulating star clusters, requir ..."
Abstract
 Add to MetaCart
algorithms have been developed. �ese algorithms apply techniques to both reduce the order of required computations, and o�en introduce data parallelisation capability. One such algorithm is Greengard and Rohklin's Fast Multipole Algorithm (FMA), which computes potentials for groups of particles via
A RayPropagation Fast Multipole Algorithm
, 1994
"... A new technique is presented for accelerating the fast multipole method, allowing rapid solution of surface integral equations for wave scattering problems. A nonnested, ray propagation approach is used to compute a matrixvector multiply in O(N 4=3 ) operations, where N is the number of unknowns ..."
Abstract

Cited by 30 (11 self)
 Add to MetaCart
A new technique is presented for accelerating the fast multipole method, allowing rapid solution of surface integral equations for wave scattering problems. A nonnested, ray propagation approach is used to compute a matrixvector multiply in O(N 4=3 ) operations, where N is the number
An Improved Fast Multipole Algorithm for Potential Fields
, 1995
"... mm QUAMSi msswrnsD i ^' A new version of the Fast Multipole Method (FMM) for potential fields is presented. While the old FMM uses multipole expansions to represent potentials, we use specially designed basis functions, displaying much faster convergence. Furthermore, we introduce an interme ..."
Abstract

Cited by 32 (3 self)
 Add to MetaCart
mm QUAMSi msswrnsD i ^' A new version of the Fast Multipole Method (FMM) for potential fields is presented. While the old FMM uses multipole expansions to represent potentials, we use specially designed basis functions, displaying much faster convergence. Furthermore, we introduce
The Fast Multipole Algorithm The X10 language
"... Evaluating the energy of a system of N bodies interacting via a pairwise potential is naïvely an O(N) problem. The Fast Multipole Method[1] uses truncated expansions in a hierarchical division of the simulation space to achieve an approximation to a specified level of accuracy in only O(N) time. A m ..."
Abstract
 Add to MetaCart
Evaluating the energy of a system of N bodies interacting via a pairwise potential is naïvely an O(N) problem. The Fast Multipole Method[1] uses truncated expansions in a hierarchical division of the simulation space to achieve an approximation to a specified level of accuracy in only O(N) time. A
USING FAST FOURIER TRANSFORM IN THE 3D MULTILEVEL FAST MULTIPOLE ALGORITHM
"... Abstract. In this paper a method is presented how to perform interpolation and anterpolation in both spherical coordinates µ and Á by trigonometric polynomials and the fast Fourier transform (FFT) in the 3D multilevel fast multipole algorithm (MLFMA). The proposed method is exact in interpolation a ..."
Abstract
 Add to MetaCart
Abstract. In this paper a method is presented how to perform interpolation and anterpolation in both spherical coordinates µ and Á by trigonometric polynomials and the fast Fourier transform (FFT) in the 3D multilevel fast multipole algorithm (MLFMA). The proposed method is exact in interpolation
A Massively Parallel Fast Multipole Algorithm in Three Dimensions
 In the proceedings of Fifth IEEE International Symposium on High Performance Distributed Computing
, 1996
"... The simulation of manybody, manyparticle system has a wide range of applications in areas such as biophysics, chemistry, astrophysics, etc. It is known that the force calculation contributes ninety percent of the simulation time. This is mainly due to the fact that the total number of interactions ..."
Abstract
 Add to MetaCart
of interactions in the force is O(N 2 ) where N is the number of particles in the system. The fast multipole algorithm, proposed by Greengard and Rokhlin, reduces the time complexity to O(N). In this paper, we design an efficient parallel fast multipole algorithm in three dimensions. For portability, our
THE SOLUTION OF LARGE EFIE PROBLEMS VIA PRECONDITIONED MULTILEVEL FAST MULTIPOLE ALGORITHM
"... electricfield integral equation, multilevel fast multipole algorithm, electromagnetic scattering. We propose an effective preconditioning scheme for the iterative solution of the systems formulated by the electricfield integral equation (EFIE). EFIE is notorious for producing difficulttosolve sy ..."
Abstract
 Add to MetaCart
electricfield integral equation, multilevel fast multipole algorithm, electromagnetic scattering. We propose an effective preconditioning scheme for the iterative solution of the systems formulated by the electricfield integral equation (EFIE). EFIE is notorious for producing difficult
Difficulties with multiple timestepping and the fast multipole algorithm in molecular dynamics
 J. Comput. Chem
, 1997
"... ABSTRACT: Numerical experiments are performed on a 36,000atom protein]DNA]water simulation to ascertain the effectiveness of two devices for reducing the time spent computing longrange electrostatics interactions. It is shown for VerletIrrRESPA multiple time stepping, which is based on approxima ..."
Abstract

Cited by 28 (8 self)
 Add to MetaCart
on approximating longrange forces as widely separated impulses, that a long time step of 5 fs results in a dramatic energy drift and that this is reduced by using an even larger long time step. It is also shown that the use of as many as six terms in a fast multipole algorithm approximation to long
Results 1  10
of
707,093