A fast multipole method for stellar dynamics

The approximate computation of all gravitational forces between $N$ interacting particles via the fast multipole method (FMM) can be made as accurate as direct summation, but requires less than $\mathcal{O}(N)$ operations. FMM groups particles into spatially bounded cells and uses cell-cell interactions to approximate the force at any position within the sink cell by a Taylor expansion obtained from the multipole expansion of the source cell. By employing a novel estimate for the errors incurred in this process, I minimise the computational effort required for a given accuracy and obtain a well-behaved distribution of force errors. For relative force errors of $\sim10^{-7}$, the computational costs exhibit an empirical scaling of $\propto N^{0.87}$. My implementation (running on a 16 core node) out-performs a GPU-based direct summation with comparable force errors for $N\gtrsim10^5$.Comment: 21 pages, 15 figures, accepted for publication in Journal for Computational Astrophysics and Cosmolog

Proximal boosting and its acceleration

Gradient boosting is a prediction method that iteratively combines weak learners to produce a complex and accurate model. From an optimization point of view, the learning procedure of gradient boosting mimics a gradient descent on a functional variable. This paper proposes to build upon the proximal point algorithm when the empirical risk to minimize is not differentiable to introduce a novel boosting approach, called proximal boosting. Besides being motivated by non-differentiable optimization, the proposed algorithm benefits from Nesterov's acceleration in the same way as gradient boosting [Biau et al., 2018]. This leads to a variant, called accelerated proximal boosting. Advantages of leveraging proximal methods for boosting are illustrated by numerical experiments on simulated and real-world data. In particular, we exhibit a favorable comparison over gradient boosting regarding convergence rate and prediction accuracy

Parallel accelerated cyclic reduction preconditioner for three-dimensional elliptic PDEs with variable coefficients

We present a robust and scalable preconditioner for the solution of large-scale linear systems that arise from the discretization of elliptic PDEs amenable to rank compression. The preconditioner is based on hierarchical low-rank approximations and the cyclic reduction method. The setup and application phases of the preconditioner achieve log-linear complexity in memory footprint and number of operations, and numerical experiments exhibit good weak and strong scalability at large processor counts in a distributed memory environment. Numerical experiments with linear systems that feature symmetry and nonsymmetry, definiteness and indefiniteness, constant and variable coefficients demonstrate the preconditioner applicability and robustness. Furthermore, it is possible to control the number of iterations via the accuracy threshold of the hierarchical matrix approximations and their arithmetic operations, and the tuning of the admissibility condition parameter. Together, these parameters allow for optimization of the memory requirements and performance of the preconditioner.Comment: 24 pages, Elsevier Journal of Computational and Applied Mathematics, Dec 201

Infrared multiphoton resummation in quantum electrodynamics

Infrared singularities in massless gauge theories are known since the foundation of quantum field theories. The root of this problem can be tracked back to the very definition of these long-range interacting theories such as QED. It can be shown that singularities are caused by the massless degrees of freedom (i.e. the photons in the case of QED). In the Bloch-Nordsieck model the absence of the infrared catastrophe can be shown exactly by the complete summation of the radiative corrections. In this paper we will give the idea of the derivation of the Bloch-Nordsieck propagator, that describes the infrared structure of the electron propagation, at zero and finite temperatures. Some ideas of the possible applications are also mentioned.Comment: 8 pages, 6 figures, uses revtex4-1, submitted to the proceedings of the PIPAMON 2015 International Worksho