Related papers: Levels of distribution for sieve problems in preho…
In many practical applications, spatial data are often collected at areal levels (i.e., block data) and the inferences and predictions about the variable at points or blocks different from those at which it has been observed typically…
We introduce a new numerical method for solving time-harmonic acoustic scattering problems. The main focus is on plane waves scattered by smoothly varying material inhomogeneities. The proposed method works for any frequency $\omega$, but…
We present a general diagrammatic approach to the construction of efficient algorithms for computing the Fourier transform of a function on a finite group. By extending work which connects Bratteli diagrams to the construction of Fast…
Local Fourier analysis is a strong and well-established tool for analyzing the convergence of numerical methods for partial differential equations. The key idea of local Fourier analysis is to represent the occurring functions in terms of a…
We present a general diagrammatic approach to the construction of efficient algorithms for computing a Fourier transform on a semisimple algebra. This extends previous work wherein we derive best estimates for the computation of a Fourier…
In this work we define a Fourier transform for each $f\in L^{p(\cdot)}(\mathbb{R})$, for a large class of exponent functions $p(\cdot)$, as the distributional derivative of a H\"older continuous function. A norm is defined in the space of…
A Fourier transform technique is introduced for counting the number of solutions of holomorphic moment map equations over a finite field. This in turn gives information on Betti numbers of holomorphic symplectic quotients. As a consequence…
A rapid transformation is derived between spherical harmonic expansions and their analogues in a bivariate Fourier series. The change of basis is described in two steps: firstly, expansions in normalized associated Legendre functions of all…
The number field sieve is the most efficient known algorithm for factoring large integers that are free of small prime factors. For the polynomial selection stage of the algorithm, Montgomery proposed a method of generating polynomials…
The Fourier-based diffraction approach is an established method to extract order and symmetry propertiesfrom a given point set. We want to investigate a different method for planar sets which works in direct spaceand relies on reduction of…
Higher-order Fourier analysis, developed over prime fields, has been recently used in different areas of computer science, including list decoding, algorithmic decomposition and testing. We extend the tools of higher-order Fourier analysis…
We propose an algorithm for finding zero divisors in quaternion algebras over quadratic number fields, or equivalently, solving homogeneous quadratic equations in three variables over $\mathbb{Q}(\sqrt{d})$ where $d$ is a square-free…
Fourier analysis and representation of circular distributions in terms of their Fourier coefficients, is quite commonly discussed and used for model-free inference such as testing uniformity and symmetry etc. in dealing with 2-dimensional…
Let a polynomial $f \in \mathbb{Z}[X_1,\ldots,X_n]$ be given. The square sieve can provide an upper bound for the number of integral $\mathbf{x} \in [-B,B]^n$ such that $f(\mathbf{x})$ is a perfect square. Recently this has been generalized…
In this paper we study the scale-space classification of signals via the maximal set of kernels. We use a geometric approach which arises naturally when we consider parameter variations in scale-space. We derive the Fourier transform…
A set of semi-analytical techniques based on Fourier analysis is used to solve wave scattering problems in variously shaped waveguides with varying normal admittance boundary conditions. Key components are newly developed conformal mapping…
In our previous works (2012, 2013), we provided a finite list of properties characterizing all potential types of quadratic birational transformations of a projective space into a factorial variety, whose base locus is smooth and…
We connect through the Fourier transform shift-invariant Sobolev type spaces $V_s\subset H^s$, $s\in\mathbb R,$ and the spaces of periodic distributions and analyze the properties of elements in such spaces with respect to the product. If…
The final goal of the present work is to extend the Fourier transform on the Heisenberg group $\H^d,$ to tempered distributions. As in the Euclidean setting, the strategy is to first show that the Fourier transform is an isomorphism on the…
We introduce a fast algorithm for computing sparse Fourier transforms supported on smooth curves or surfaces. This problem appear naturally in several important problems in wave scattering and reflection seismology. The main observation is…