Related papers: hankl: A lightweight Python implementation of the …
Fast Fourier Transform (FFT) is an efficient algorithm to compute the Discrete Fourier Transform (DFT) and its inverse. In this paper, we pay special attention to the description of complex-data FFT. We analyze two common descriptions of…
We present a new software pipeline -- PyMorph -- for automated estimation of structural parameters of galaxies. Both parametric fits through a two dimensional bulge disk decomposition as well as structural parameter measurements like…
Energy evaluation using fast Fourier transforms enables sampling billions of putative complex structures and hence revolutionized rigid protein-protein docking. However, in current methods efficient acceleration is achieved only in either…
We present the 2-point function from Fast and Accurate Spherical Bessel Transformation (2-FAST) algorithm for a fast and accurate computation of integrals involving one or two spherical Bessel functions. These types of integrals occur when…
Large language models (LLMs) require substantial compute, and thus energy, at inference time. While quantizing weights and activations is effective at improving efficiency, naive quantization of LLMs can significantly degrade performance…
We use dynamical system methods to explore the general behaviour of $f(T)$ cosmology. In contrast to the standard applications of dynamical analysis, we present a way to transform the equations into a one-dimensional autonomous system,…
Fourier transforms are an often necessary component in many computational tasks, and can be computed efficiently through the fast Fourier transform (FFT) algorithm. However, many applications involve an underlying continuous signal, and a…
We study two key issues militating against the use of the anisotropic three-point correlation function (3PCF) for cosmological parameter inference: difficulties with its computational estimation and high-dimensionality. We show how…
Current and upcoming cosmological experiments open a new era of precision cosmology, thus demanding accurate theoretical predictions for cosmological observables. Because of the complexity of the codes delivering such predictions, reaching…
The convolution potential arises in a wide variety of application areas, and its efficient and accurate evaluation encounters three challenges: singularity, nonlocality and anisotropy. We introduce a fast algorithm based on a far-field…
We discuss in some details a novel algorithm for performing partial-sky spherical harmonic transforms (SHT), building on the Fourier-sphere method of Reinecke et al (2023) handling efficiently high numbers of arbitrary locations on the…
We investigate a hybrid numerical algorithm aimed at the large-scale cosmological N-body simulation for the on-going and the future high precious sky surveys. It makes use of a truncated Fast Multiple Method (FMM) for short-range gravity,…
We discuss the fundamental role of entanglement as the essential nonclassical feature providing the computational speed-up in the known quantum algorithms. We review the construction of the Fourier transform on an Abelian group and the…
An important component of many image alignment methods is the calculation of inner products (correlations) between an image of $n\times n$ pixels and another image translated by some shift and rotated by some angle. For robust alignment of…
Based on the canonical Lang-Firsov transformation of the Hamiltonian we develop a very efficient quantum Monte Carlo algorithm for the Holstein model with one electron. Separation of the fermionic degrees of freedom by a reweighting of the…
Recently, a new field of study called fractional cosmology has emerged. It uses fractional calculus to modify the standard derivative equations and change the Friedmann equations. The evolution of cosmic species densities is also affected…
Particle physicists at the Large Hadron Collider investigate the properties of matter at subatomic length scales by colliding together bunches of high-energy protons and observing the decay products of the collisions. ATLAS is one of two…
Discrete transforms such as the discrete Fourier transform (DFT) and the discrete Hartley transform (DHT) are important tools in numerical analysis. The successful application of transform techniques relies on the existence of efficient…
Analytical computations in relativistic cosmology can be split into two sets: time evolution relating the initial conditions to the observer's light-cone and light propagation to obtain observables. Cosmological perturbation theory in the…
In this paper we offer a review and bibliography of work on Hankel low-rank approximation and completion, with particular emphasis on how this methodology can be used for time series analysis and forecasting. We begin by describing possible…