Related papers: A Simple Formulation of the Fast Multipole Method:…
The three most common methods, Ewald, fast multipole (FMM) and the particle-particle particle-mesh (PPPM), used to compute the interactions in many body Coulombic systems are compared for single and multi-processor machines. The Ewald…
The Barnes-Hut and Fast Multipole Methods are widely utilised methods applied in order to reduce the computational cost of evaluating long range forces in $N$-body simulations. Despite this, applying existing libraries to simple problems…
Molecular simulations are essential tools in computational chemistry, enabling the prediction and understanding of molecular interactions and thermodynamic properties of biomolecules. However, traditional force fields face significant…
In this article we consider recursive approximations of the smoothing distribution associated to partially observed stochastic differential equations (SDEs), which are observed discretely in time. Such models appear in a wide variety of…
The branching methods developed are effective methods to solve some semi linear PDEs and are shown numerically to be able to solve some full non linear PDEs. These methods are however restricted to some small coefficients in the PDE and…
We present a highly scalable algorithm for multiplying sparse multivariate polynomials represented in a distributed format. This algo- rithm targets not only the shared memory multicore computers, but also computers clusters or specialized…
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…
The Tree-Particle-Mesh (TPM) N-body algorithm couples the tree algorithm for directly computing forces on particles in an hierarchical grouping scheme with the extremely efficient mesh based PM structured approach. The combined TPM…
Tree-based demappers for multiple-input multiple-output (MIMO) detection such as the sphere decoder can achieve near-optimal performance but incur high computational cost due to their sequential nature. In this paper, we propose the…
A novel adaptive technique for electromagnetic Particle In Cell (PIC) plasma simulations is presented here. Two main issues are identified in designing adaptive techniques for PIC simulation: first, the choice of the size of the particle…
We describe the TreePM method for carrying out large N-Body simulations to study formation and evolution of the large scale structure in the Universe. This method is a combination of Barnes and Hut tree code and Particle-Mesh code. It…
Pseudo-arclength continuation is a well-established method for generating a numerical curve approximating the solution of an underdetermined system of nonlinear equations. It is an inherently sequential predictor-corrector method in which…
In practice, LDPC codes are decoded using message passing methods. These methods offer good performance but tend to converge slowly and sometimes fail to converge and to decode the desired codewords correctly. Recently, tree-reweighted…
The aim of this paper is to investigate the unstable nature of pressure computation focusing on incompressible flow modeling through the projection-based particle methods. A new approach from the original viewpoint of the momentum…
Large classes of materials systems in physics and engineering are governed by magnetic and electrostatic interactions. Continuum or mesoscale descriptions of such systems can be cast in terms of integral equations, whose direct…
A probabilistic shaping method for multi-level coding (MLC) is presented, where the transmitted symbols are forced to have a shaped non-uniform distribution. It is shown that shaping only a single bit-level suffices to compensate for most…
Application of the turbo principle to multiuser decoding results in an exchange of probability distributions between two sets of constraints. Firstly, constraints imposed by the multiple-access channel, and secondly, individual constraints…
In this paper, we present a spherical Fast Multipole Method (sFMM) for ray tracing simulation of gravitational lensing (GL) on a curved sky. The sFMM is a non-trivial extension of the Fast Multiple Method (FMM) to sphere $\mathbb S^2$, and…
The pseudospectral method is a highly accurate numerical scheme suitable for turbulence simulations. We have developed an open-source pseudospectral code, \textsc{\textsf{Calliope}}, which adopts the P3DFFT library \citep{Pekurovsky2012} to…
The present paper studies two particle management strategies for dynamically adaptive Cartesian grids at hands of a particle-in-cell code. One holds the particles within the grid cells, the other within the grid vertices. The fundamental…