Related papers: Hybrid FFT algorithm for fast demagnetization fiel…
We investigate possibilities to speed up iterative algorithms for non-blind image deconvolution. We focus on algorithms in which convolution with the point-spread function to be deconvolved is used in each iteration, and aim at accelerating…
Based on recent advancements in using machine learning for classical density functional theory for systems with one-dimensional, planar inhomogeneities, we propose a machine learning model for application in two dimensions (2D) akin to…
The Fast Multipole Method (FMM) reduces the computation of pairwise two-body interactions among $N$-particles to order $N$, whose computation cost should be of order $N^2$ by brute force. However, its implementation is somewhat complicated…
Neural radiance-density field methods have become increasingly popular for the task of novel-view rendering. Their recent extension to hash-based positional encoding ensures fast training and inference with visually pleasing results.…
Effective demagnetizing factors that connect the sample magnetic moment with the applied magnetic field are calculated numerically for perfectly diamagnetic samples of various non-ellipsoidal shapes. The procedure is based on calculating…
With tens of petaflops supercomputers already in operation and exaflops machines expected to appear within the next 10 years, efficient parallel computational methods are required to take advantage of such extreme-scale machines. In this…
In image deconvolution problems, the diagonalization of the underlying operators by means of the FFT usually yields very large speedups. When there are incomplete observations (e.g., in the case of unknown boundaries), standard…
The performance of multivariate kernel density estimation (KDE) depends strongly on the choice of bandwidth matrix. The high computational cost required for its estimation provides a big motivation to develop fast and accurate methods. One…
This paper introduces a new approach for the computation of electromagnetic field derivatives, up to any order, with respect to the material and geometric parameters of a given geometry, in a single Finite-Difference Time-Domain (FDTD)…
We propose fast, exact and efficient algorithms for the convolution of two arbitrary functions on the sphere which speed up computations by a factor \order{\sqrt{N}} compared to present methods where $N$ is the number of pixels. No…
We present the open source micromagnetic framework, MagTense, which utilizes a novel discretization approach of rectangular cuboid or tetrahedron geometry "tiles" to analytically calculate the demagnetization field. Each tile is assumed to…
In this paper we present a new approach to deblur the effect of atmospheric turbulence in the case of long range imaging. Our method is based on an analytical formulation, the Fried kernel, of the atmosphere modulation transfer function…
In this article, we explore the use of contour deformation for the numerical evaluation of Feynman integrals after sector decomposition. In existing codes, the contour of integration is determined heuristically for each phase-space point by…
We present a fast and accurate algorithm for the evaluation of nonlocal (long-range) Coulomb and dipole-dipole interactions in free space. The governing potential is simply the convolution of an interaction kernel $U(\bx)$ and a density…
When a pulsed, few-cycle electromagnetic wave is focused by optics with f-number smaller than two, the frequency components it contains are focused to different regions of space, building up a complex electromagnetic field structure.…
The separability assumption (Donoho & Stodden, 2003; Arora et al., 2012) turns non-negative matrix factorization (NMF) into a tractable problem. Recently, a new class of provably-correct NMF algorithms have emerged under this assumption. In…
Due to its non-local nature, calculating the demagnetizing field remains the biggest challenge in understanding domain structures in ferromagnetic materials. Analytical descriptions of demagnetizing effects typically approximate domain…
This review presents a concise, yet comprehensive discussion on the evolution of theoretical methods employed to determine the ground and excited states of molecules in weak and strong magnetic fields. The weak-field cases have been studied…
We introduce a fast algorithm for computing volume potentials - that is, the convolution of a translation invariant, free-space Green's function with a compactly supported source distribution defined on a uniform grid. The algorithm relies…
Multiresolution Matrix Factorization (MMF) was recently introduced as an alternative to the dominant low-rank paradigm in order to capture structure in matrices at multiple different scales. Using ideas from multiresolution analysis (MRA),…