English
Related papers

Related papers: Rotation method for accelerating multiple-spherica…

200 papers

We investigate integral formulations and fast algorithms for the steady-state radiative transfer equation with isotropic and anisotropic scattering. When the scattering term is a smooth convolution on the unit sphere, a model reduction step…

Numerical Analysis · Mathematics 2019-02-20 Yuwei Fan , Jing An , Lexing Ying

Singlet fission (SF) is an electronic transition that in the last decade has been under the spotlight for its applications in optoelectronics, from photovoltaics to spintronics. Despite considerable experimental and theoretical…

Quantum Physics · Physics 2024-11-12 Francesco Campaioli , Alice Pagano , Daniel Jaschke , Simone Montangero

Measurements of line-of-sight dependent clustering via the galaxy power spectrum's multipole moments constitute a powerful tool for testing theoretical models in large-scale structure. Recent work shows that this measurement, including a…

Cosmology and Nongalactic Astrophysics · Physics 2017-07-19 Nick Hand , Yin Li , Zachary Slepian , Uros Seljak

We describe an efficient algorithm for computing the matrix vector products that appear in the numerical resolution of boundary integral equations in 2 space dimension. This work is an extension of the so-called Sparse Cardinal Sine…

Numerical Analysis · Mathematics 2017-11-22 Martin Averseng

The $N$-point discrete Fourier transform (DFT) is a cornerstone for several signal processing applications. Many of these applications operate in real-time, making the computational complexity of the DFT a critical performance indicator to…

Data Structures and Algorithms · Computer Science 2024-12-18 Saulo Queiroz , João P. Vilela , Edmundo Monteiro

Although Fourier series approximation is ubiquitous in computational physics owing to the Fast Fourier Transform (FFT) algorithm, efficient techniques for the fast evaluation of a three-dimensional truncated Fourier series at a set of…

Numerical Analysis · Mathematics 2017-03-08 Marco Caliari , Simone Zuccher

Three-centre nuclear attraction integrals, which arise in density functional and \textit{ab initio} calculations, are one of the most time-consuming computations involved in molecular electronic structure calculations. Even for relatively…

Numerical Analysis · Mathematics 2024-12-20 Jordan Lovrod , Hassan Safouhi

Fast Fourier transform (FFT) based methods have turned out to be an effective computational approach for numerical homogenisation. In particular, Fourier-Galerkin methods are computational methods for partial differential equations that are…

Numerical Analysis · Mathematics 2020-04-22 Jaroslav Vondřejc , Dishi Liu , Martin Ladecký , Hermann G. Matthies

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…

Numerical Analysis · Mathematics 2026-02-26 Ralf Hielscher , Erik Wuensche

Gravitational waves (GWs) exhibit wave-optics effects when their wavelength is comparable to the scale of the gravitational lens. This may occur in lensing from galactic subhalos in GWs emitted by binary black-hole mergers, and is gaining…

Cosmology and Nongalactic Astrophysics · Physics 2026-03-16 Nino Ephremidze , Marc Kamionkowski , Cora Dvorkin

As we all known, the nonnegative matrix factorization (NMF) is a dimension reduction method that has been widely used in image processing, text compressing and signal processing etc. In this paper, an algorithm for nonnegative matrix…

Numerical Analysis · Mathematics 2013-05-27 Shu-Zhen Lai , Hou-Biao Li , Zu-Tao Zhang

This work illustrates the possibility to apply the Fast Fourier Transformation to obtain the integrals of the Boundary Element Method (BEM) on arbitrary shapes. The procedure is inspired by the technique used with great success within the…

Computational Physics · Physics 2018-09-05 Justus Benad

Bayesian inference, while foundational to probabilistic reasoning, is often hampered by the computational intractability of posterior distributions, particularly through the challenging evidence integral. Conventional approaches like Markov…

Machine Learning · Computer Science 2025-11-11 Di Zhang

Computationally efficient numerical methods for high-order approximations of convolution integrals involving weakly singular kernels find many practical applications including those in the development of fast quadrature methods for…

Numerical Analysis · Mathematics 2018-10-10 Akash Anand , Awanish Kumar Tiwari

The Cosmic Microwave Background (CMB) data analysis and the map-making process rely heavily on the use of spherical harmonics. For suitable pixelizations of the sphere, the (forward and inverse) Fourier transform plays a crucial role in…

We present an algorithm for quickly generating multiple realizations of N-body simulations to be used, for example, for cosmological parameter estimation from surveys of large-scale structure. Our algorithm uses a new method to resample the…

Cosmology and Nongalactic Astrophysics · Physics 2015-05-27 Michael D. Schneider , Shaun Cole , Carlos S. Frenk , Istvan Szapudi

Progress towards the energy breakthroughs needed to combat climate change can be significantly accelerated through the efficient simulation of atomic systems. Simulation techniques based on first principles, such as Density Functional…

Machine Learning · Computer Science 2021-06-18 Muhammed Shuaibi , Adeesh Kolluru , Abhishek Das , Aditya Grover , Anuroop Sriram , Zachary Ulissi , C. Lawrence Zitnick

Scalar diffraction calculations such as the angular spectrum method (ASM) and Fresnel diffraction, are widely used in the research fields of optics, X-rays, electron beams, and ultrasonics. It is possible to accelerate the calculation using…

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…

Numerical Analysis · Mathematics 2020-02-19 Aaditya Rangan , Marina Spivak , Joakim Andén , Alex Barnett

Recently, a new polynomial basis over binary extension fields was proposed such that the fast Fourier transform (FFT) over such fields can be computed in the complexity of order $\mathcal{O}(n\lg(n))$, where $n$ is the number of points…

Information Theory · Computer Science 2016-08-16 Sian-Jheng Lin , Tareq Y. Al-Naffouri , Yunghsiang S. Han