Related papers: Fast SGL Fourier transforms for scattered data
This paper introduces an efficient algorithm for computing the general oscillatory matrix functions. These computations are crucial for solving second-order semi-linear initial value problems. The method is exploited using the scaling and…
Accurately estimating the point spread function (PSF) of an optical system requires solving free-space wave propagation, which entails evaluating a diffraction integral. This integral is traditionally computed numerically using Fast Fourier…
One of the key challenges in the area of signal processing on graphs is to design transforms and dictionaries methods to identify and exploit structure in signals on weighted graphs. In this paper, we first generalize graph Fourier…
Several recent works have demonstrated the powerful algebraic simplifications that can be achieved for scattering amplitudes through a systematic grading of transcendental quantities. We develop these concepts to construct a minimal basis…
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…
We give two algebro-geometric inspired approaches to fast algorithms for Fourier transforms in algebraic signal processing theory based on polynomial algebras in several variables. One is based on module induction and one is based on a…
We present a sublinear randomized algorithm to compute a sparse Fourier transform for nonequispaced data. Suppose a signal S is known to consist of N equispaced samples, of which only L<N are available. If the ratio p=L/N is not close to 1,…
Reconstructing an infinite-dimensional signal from a finite set of measurements is a fundamental problem in approximation theory and signal processing. While the generalized sampling (GS) framework provides a robust methodology for…
This paper introduces a fast algorithm, applicable throughout the electromagnetic spectrum, for the numerical solution of problems of scattering by periodic surfaces in two-dimensional space. The proposed algorithm remains highly accurate…
In this article, we develop comprehensive frequency domain methods for estimating and inferring the second-order structure of spatial point processes. The main element here is on utilizing the discrete Fourier transform (DFT) of the point…
We give a new fast method for evaluating sprectral approximations of nonlinear polynomial functionals. We prove that the new algorithm is convergent if the functions considered are smooth enough, under a general assumption on the spectral…
In this paper we develop a class of efficient Galerkin boundary element methods for the solution of two-dimensional exterior single-scattering problems. Our approach is based upon construction of Galerkin approximation spaces confined to…
Using normalized Hermite functions, we construct bases in the space of square integrable functions on the unit circle ($L^2(\mathcal C)$) and in $l_2(\mathbb Z)$, which are related to each other by means of the Fourier transform and the…
In this paper we consider the problem of approximating function evaluations $f(\boldsymbol x_j)$ at given nonequispaced points $\boldsymbol x_j$, $j=1,\dots N$, of a bandlimited function from given values $\hat{f}(\boldsymbol k)$,…
Recently, an approach to graph signal processing based on graphons was proposed. Here we show how such a graphon-driven approach to the Fourier transform can be used on graphs sampled from a stochastic block model (SBM). In particular, we…
Learning physical simulations has been an essential and central aspect of many recent research efforts in machine learning, particularly for Navier-Stokes-based fluid mechanics. Classic numerical solvers have traditionally been…
This paper develops a finite-difference analogue of the boundary integral/element method for the numerical solution of two-dimensional exterior scattering from scatterers of arbitrary shapes. The discrete fundamental solution, known as the…
In this paper a deterministic sparse Fourier transform algorithm is presented which breaks the quadratic-in-sparsity runtime bottleneck for a large class of periodic functions exhibiting structured frequency support. These functions…
We will give new applications of quantum groups to the study of spherical Whittaker functions on the metaplectic $n$-fold cover of $GL(r,F)$, where $F$ is a nonarchimedean local field. Earlier Brubaker, Bump, Friedberg, Chinta and Gunnells…
We developed fast direct solver for 3D Helmholtz and Maxwell equations in layered medium. The algorithm is based on the ideas of cyclic reduction for separable matrices. For the grids with major uniform part (within the survey domain in the…