Related papers: Fast algorithms for spherical harmonic expansions,…
We present a fast algorithm for generating full sky, high resolution ($\sim 5'$) simulations of the CMB anisotropy pattern. We also discuss the inverse problem, that of evaluating from such a map the full set of $a_{\ell m}$'s and the…
It is demonstrated is this letter that linear multistep methods for integrating ordinary differential equations can be used to develop a family of fast forward scattering algorithms with higher orders of convergence. Excluding the cost of…
In this paper we describe a new technique to generate and use surfels for rendering of highly complex, polygonal 3D scenes in real time. The basic idea is to approximate complex parts of the scene by rendering a set of points (surfels). The…
A fast algorithm is developed for the directional correlation of scalar band-limited signals and band-limited steerable filters on the sphere. The asymptotic complexity associated to it through simple quadrature is of order O(L^5), where 2L…
Bipartite networks are of great importance in many real-world applications. In bipartite networks, butterfly (i.e., a complete 2 x 2 biclique) is the smallest non-trivial cohesive structure and plays a key role. In this paper, we study the…
We analyze the Double Fourier Sphere (DFS) method on the rotation group $\mathcal{SO}(3)$ in the frequency domain and demonstrate its central role in fast algorithms. Fast Fourier algorithms on $\mathcal{SO}(3)$ are commonly formulated as a…
Long-term stability studies of nonlinear Hamiltonian systems require symplectic integration algorithms which are both fast and accurate. In this paper, we study a symplectic integration method wherein the symplectic map representing the…
We use the 1+3 frame formalism to write down the evolution equations for spherically symmetric models as a well-posed system of first order PDEs in two variables, suitable for numerical and qualitative analysis.
Simflowny is an open platform which automatically generates efficient parallel code of scientific dynamical models for different simulation frameworks. Here we present major upgrades on this software to support simultaneously a quite…
We present a general diagrammatic approach to the construction of efficient algorithms for computing a Fourier transform on a semisimple algebra. This extends previous work wherein we derive best estimates for the computation of a Fourier…
In computer science, transforming spherical coordinates into Cartesian coordinates is an important mathematical operation. The CORDIC (Coordinate Rotation Digital Computer) iterative algorithm can perform this operation, as well as…
Probabilistic breadth-first traversals (BPTs) are used in many network science and graph machine learning applications. In this paper, we are motivated by the application of BPTs in stochastic diffusion-based graph problems such as…
The phase estimation algorithm is a powerful quantum algorithm with applications in cryptography, number theory, and simulation of quantum systems. We use this algorithm to simulate the time evolution of a system of two spin-1/2 particles…
The present paper deals with the problem of improving the efficiency of large scale turbulent flow simulations. The high-fidelity methods for modelling turbulent flows become available for a wider range of applications thanks to the…
This paper introduces a fast Central Processing Unit (CPU) implementation of geodesic morphological operations using stream processing. In contrast to the current state-of-the-art, that focuses on achieving insensitivity to the filter sizes…
Breadth-First Search (BFS) is a building block used in a wide array of graph analytics and is used in various network analysis domains: social, road, transportation, communication, and much more. Over the last two decades, network sizes…
The Numerical Recipes series of books are a useful resource, but all the algorithms they contain cannot be used within open-source projects. In this paper we develop drop-in alternatives to the two algorithms they present for cubic spline…
A symplectic, symmetric, second-order scheme is constructed for particle evolution in a time-dependent field with a fixed spatial step. The scheme is implemented in one space dimension and tested, showing excellent adequacy to experiment…
We present an efficient quantum algorithm to measure the average fidelity decay of a quantum map under perturbation using a single bit of quantum information. Our algorithm scales only as the complexity of the map under investigation, so…
In this paper, we introduce several new schemes for calculation of discrete wavelet transforms of images. These schemes reduce the number of steps and, as a consequence, allow to reduce the number of synchronizations on parallel…