Related papers: Towards higher order numerical stochastic perturba…
We present the results of an exploratory study of the numerical stochastic perturbation theory (NSPT) applied to the four dimensional twisted Eguchi-Kawai (TEK) model. We employ a Kramers type algorithm based on the Generalized Hybrid…
Modern processors deliver higher throughput for lower-precision arithmetic than for higher-precision arithmetic. For matrix multiplication, the Ozaki scheme exploits this performance gap by splitting the inputs into lower-precision…
We explore two classes of exponential integrators in this letter to design nonlinear Fourier transform (NFT) algorithms with a desired accuracy-complexity trade-off and a convergence order of $4$ on an equispaced grid. The integrating…
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…
This paper develops fast graph Fourier transform (GFT) algorithms with O(n log n) runtime complexity for rank-one updates of the path graph. We first show that several commonly-used audio and video coding transforms belong to this class of…
We outline a strategy to compute the second-loop contribution to the Csw coefficient of the Sheikoleslami-Wohlert-Wilson fermion action by means of NSPT. We also present preliminary results for higher-order integrators for the Langevin…
We present a novel algorithm, FAST-PT, for performing convolution or mode-coupling integrals that appear in nonlinear cosmological perturbation theory. The algorithm uses several properties of gravitational structure formation -- the…
The Number Theoretic Transform (NTT) is a critical computational bottleneck in many lattice-based postquantum cryptographic (PQC) algorithms. By leveraging the Fast Fourier Transform (FFT) algorithm, the NTT of a polynomial of degree N - 1…
The nonlinear Fourier transform (NFT) has recently gained significant attention in fiber optic communications and other engineering fields. Although several numerical algorithms for computing the NFT have been published, the design of…
The treatment of hypercubic lattice artifacts is essential for the calculation of non-perturbative renormalization constants of RI-MOM schemes. It has been shown that for the RI'-MOM scheme a large part of these artifacts can be calculated…
Exponential time differencing methods is a power tool for high-performance numerical simulation of computationally challenging problems in condensed matter physics, fluid dynamics, chemical and biological physics, where mathematical models…
Numerical Stochastic Perturbation Theory (NSPT) allows for perturbative computations in quantum field theory. We present an implementation of NSPT that yields results for high orders in the perturbative expansion of lattice gauge theories…
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…
We develop the Fourier-Laplace Inversion of the Perturbation Theory (FLIPT), a novel numerically exact "black box" method to compute perturbative expansions of the density matrix with rigorous convergence conditions. Specifically, the FLIPT…
Given a time series vector, how can we efficiently compute a specified part of Fourier coefficients? Fast Fourier transform (FFT) is a widely used algorithm that computes the discrete Fourier transform in many machine learning applications.…
An efficient procedure for error-value calculations based on fast discrete Fourier transforms (DFT) in conjunction with Berlekamp-Massey-Sakata algorithm for a class of affine variety codes is proposed. Our procedure is achieved by…
Cosmological perturbation theory is a powerful tool to predict the statistics of large-scale structure in the weakly non-linear regime, but even at 1-loop order it results in computationally expensive mode-coupling integrals. Here we…
We use large spin perturbation theory and the Lorentzian inversion formula to compute order-$\varepsilon$ corrections to mixed correlators in the $O(n)$ Wilson-Fisher CFT in $4 - \varepsilon$ dimensions. In particular, we find the scaling…
The graph Fourier transform (GFT) is in general dense and requires O(n^2) time to compute and O(n^2) memory space to store. In this paper, we pursue our previous work on the approximate fast graph Fourier transform (FGFT). The FGFT is…
We explore the class of exponential integrators known as exponential time differencing (ETD) method in this letter to design low complexity nonlinear Fourier transform (NFT) algorithms that compute discrete approximations of the scattering…