Related papers: An $O(N^3)$ algorithm for the calculation of far f…
We address a linear fractional differential equation and develop effective solution methods using algorithms for inversion of triangular Toeplitz matrices and the recently proposed QTT format. The inverses of such matrices can be computed…
We propose a new algorithm for simulating noncommutative phi-four theory on the fuzzy sphere based on, i) coupling the scalar field to a U(1) gauge field, in such a way that in the commutative limit N\longrightarrow \infty, the two modes…
We use lookup tables to design faster algorithms for important algebraic problems over finite fields. These faster algorithms, which only use arithmetic operations and lookup table operations, may help to explain the difficulty of…
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…
3D point cloud-based place recognition is highly demanded by autonomous driving in GPS-challenged environments and serves as an essential component (i.e. loop-closure detection) in lidar-based SLAM systems. This paper proposes a novel…
We describe an explicit algorithm to factorize an even antisymmetric N^2 matrix into triangular and trivial factors. This allows for a straight forward computation of Pfaffians (including their signs) at the cost of N^3/3 flops.
The paper is devoted to the development of the octonion Fourier transform (OFT) theory initiated in 2011 in articles by Hahn and Snopek. It is also a continuation and generalization of earlier work by Blaszczyk and Snopek, where they proved…
The nonlinear Fourier transform (NLFT) extends the classical Fourier transform by replacing addition with matrix multiplication. While the NLFT on $\mathrm{SU}(1,1)$ has been widely studied, its $\mathrm{SU}(2)$ variant has only recently…
We present a new method for estimating the Neural Reflectance Field (NReF) of an object from a set of posed multi-view images under unknown lighting. NReF represents 3D geometry and appearance of objects in a disentangled manner, and are…
The Quantum Fourier Transform (QFT) is required by hidden subgroup problem (HSP) algorithms, including Shor's algorithm for factoring. The circuit depth of the QFT remains challenging for near-term hardware. To find shallower alternatives…
Researchers from a broad spectrum of scientific and engineering disciplines are increasingly using near-field infrared spectroscopic techniques to characterize materials nondestructively and with nanoscale spatial resolution. However,…
Density Functional Theory (DFT) is widely used for atomistic simulations. However, its reach stays limited due to several limitations such as lack of accurate exchange-correlation functional, requirement of costly O(N 3) diagonalization…
Nonnegative Matrix Factorization (NMF) is the problem of approximating a nonnegative matrix with the product of two low-rank nonnegative matrices and has been shown to be particularly useful in many applications, e.g., in text mining, image…
Non-negative matrix factorization (NMF) is a fundamental matrix decomposition technique that is used primarily for dimensionality reduction and is increasing in popularity in the biological domain. Although finding a unique NMF is generally…
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…
Future generations of radio interferometers targeting the 21\,cm signal at cosmological distances with $N\gg 1000$ antennas could face a significant computational challenge in building correlators with the traditional architecture, whose…
We discuss an algorithm for the numerical evaluation of NLO multiparton processes. We focus hereby on the virtual part of the NLO calculation, i.e. on evaluating the one-loop integration numerically. We employ and extend the ideas of the…
The Hausdorff fractal dimension has been a fast-to-calculate method to estimate complexity of fractal shapes. In this work, a modified version of this fractal dimension is presented in order to make it more robust when applied in estimating…
Inferring brain connectivity and structure \textit{in-vivo} requires accurate estimation of the orientation distribution function (ODF), which encodes key local tissue properties. However, estimating the ODF from diffusion MRI (dMRI)…
A unified method for three-dimensional reconstruction of objects from transmission images collected at multiple illumination directions is described. The method may be applicable to experimental conditions relevant to absorption-based,…