Related papers: Yet another fast multipole method without multipol…
The Fast Multipole Method (FMM) for the Poisson equation is extended to the case of non-axisymmetric problems in an axisymmetric domain, described by cylindrical coordinates. The method is based on a Fourier decomposition of the source into…
Particle methods are less computationally efficient than grid based numerical solution of the Navier Stokes equation. However, they have important advantages including rigorous mass conservation, momentum conservation and isotropy. In…
The performance of numerical micromagnetic models is limited by the demagnetizing field computation, which typically accounts for the majority of the computation time. For magnetization dynamics simulations explicit evaluation methods are…
We consider a wide class of two-dimensional models as gauge theories, Gross-Neveu model, $O(N)$ and $CP^{N-1}$-like models using a formalism based on the introduction of bilocal fields that permits to perform easily the large-N expansion of…
We present a quasi-linearly scaling, first order polynomial finite element method for the solution of the magnetostatic open boundary problem by splitting the magnetic scalar potential. The potential is determined by solving a Dirichlet…
We present efficient algorithms to build data structures and the lists needed for fast multipole methods. The algorithms are capable of being efficiently implemented on both serial, data parallel GPU and on distributed architectures. With…
In this paper, a novel multigrid method based on Newton iteration is proposed to solve nonlinear eigenvalue problems. Instead of handling the eigenvalue $\lambda$ and eigenfunction $u$ separately, we treat the eigenpair $(\lambda, u)$ as…
The large sparse linear systems arising from the finite element or finite difference discretization of elliptic PDEs can be solved directly via, e.g., nested dissection or multifrontal methods. Such techniques reorder the nodes in the grid…
Interpolating scaling functions give a faithful representation of a localized charge distribution by its values on a grid. For such charge distributions, using a Fast Fourier method, we obtain highly accurate electrostatic potentials for…
A new approach for tree-level amplitudes with multiple fermion lines is presented. It mainly focuses on the simplification of fermion lines. By calculating two vectors recursively without any matrix multiplications, the result of a fermion…
A scheme is developed for creating pseudopotentials for use in correlated-electron calculations. Pseudopotentials for the light elements H, Li, Be, B, C, N, O, and F, are reported, based on data from high-level quantum chemical…
In this work we review a recently proposed transformation which is useful in order to simplify non-polynomial potentials given in the form of an exponential. As an application, it is shown that the Liouville field theory may be mapped into…
In this talk I review some recent results concerning multi-instanton calculus in supersymmetric field theories. More in detail, I will show how these computations can be efficiently performed using the formalism of topological field…
We present Particle-Particle-Particle-Mesh (PPPM) and Tree Particle-Mesh (TreePM) implementations on GRAPE-5 and GRAPE-6A systems, special-purpose hardware accelerators for gravitational many-body simulations. In our PPPM and TreePM…
We present a simple semi-streaming algorithm for $(1-\epsilon)$-approximation of bipartite matching in $O(\log{\!(n)}/\epsilon)$ passes. This matches the performance of state-of-the-art "$\epsilon$-efficient" algorithms -- the ones with…
We present new efficient (O(N log N)) methods for computing three quantities crucial to electronic structure calculations: the ionic potential, the electron-ion contribution to the Born-Oppenheimer forces, and the electron-ion contribution…
Tensor decomposition is a fundamental method used in various areas to deal with high-dimensional data. \emph{Tensor power method} (TPM) is one of the widely-used techniques in the decomposition of tensors. This paper presents a novel tensor…
We show that the pseudoflow algorithm for maximum flow is particularly efficient for the bipartite matching problem both in theory and in practice. We develop several implementations of the pseudoflow algorithm for bipartite matching, and…
In this article, we propose a spectral method for a class of multivariate inhomogeneous spatial point processes, namely the second-order intensity reweighted stationary processes. A key ingredient of our approach is utilizing the asymptotic…
Linear scaling methods, or O(N) methods, have computational and memory requirements which scale linearly with the number of atoms in the system, N, in contrast to standard approaches which scale with the cube of the number of atoms. These…