English
Related papers

Related papers: Discrete nonlinear Fourier transforms and their in…

200 papers

We revisit the Fourier transform of a Hankel function, of considerable importance in the theory of knife edge diffraction. Our approach is based directly upon the underlying Bessel equation, which admits manipulation into an alternate…

General Mathematics · Mathematics 2021-12-21 J. A. Grzesik

We define a nonlinear Fourier transform which maps sequences of contractive $n \times n$ matrices to $SU(2n)$-valued functions on the circle $\mathbb{T}$. We characterize the image of finitely supported sequences and square-summable…

Classical Analysis and ODEs · Mathematics 2026-03-24 Michel Alexis , Lars Becker , Diogo Oliveira e Silva , Christoph Thiele

The special unitary group SU(2) plays a fundamental role in the description of symmetries in quantum mechanics, theoretical physics, and spherical signal processing. In this paper, we address the computational challenges of performing…

Computational Physics · Physics 2026-05-26 Julio Delgado , Alejandro Umaña

Building on earlier work, the dipole subtraction formalism for photonic corrections is extended to various photon--fermion splittings where the resulting collinear singularities lead to corrections that are enhanced by logarithms of small…

High Energy Physics - Phenomenology · Physics 2008-11-26 Stefan Dittmaier , Alois Kabelschacht , Tobias Kasprzik

This paper is centred on the spectral study of a Random Fourier matrix, that is an $n\times n$ matrix $A$ whose $(j, k)$ entries are $\exp(2i\pi m X_jY_k)$, with $X_j$ and $Y_k$ two i.i.d sequences of random variables and $1\leq m\leq n$ is…

Classical Analysis and ODEs · Mathematics 2019-04-16 Aline Bonami , Abderrazek Karoui

We prove the Plancherel formula for a four-parameter family of discrete Fourier transforms and their multivariate generalizations stemming from corresponding generalized Schur polynomials. For special choices of the parameters, this…

Numerical Analysis · Mathematics 2019-02-25 J. F. van Diejen , E. Emsiz

We introduce and study new refinements of inversion statistics for permutations, such as k-step inversions, (the number of inversions with fixed position differences) and non-inversion sums (the sum of the differences of positions of the…

Combinatorics · Mathematics 2012-01-13 Joshua Sack , Henning Úlfarsson

The one-dimensional (1D) fractional Fourier transform (FRFT) generalizes the Fourier transform, offering significant advantages in the time-frequency analysis of non-stationary signals. While various 2D extensions exist, such as the 2D…

Signal Processing · Electrical Eng. & Systems 2026-03-03 Daxiang Li , Zhichao Zhang , Wei Yao

Properties of the four families of recently introduced special functions of two real variables, denoted here by $E^\pm$, and $\cos^\pm$, are studied. The superscripts $^+$ and $^-$ refer to the symmetric and antisymmetric functions…

Mathematical Physics · Physics 2010-02-23 Jiří Hrivnák , Jiří Patera

Calculations of the Fourier transform of a constant quantity over an area or volume defined by polygons (connected vertices) are often useful in modeling wave scattering, or in fourier-space filtering of real-space vector-based volumes and…

Numerical Analysis · Mathematics 2021-04-20 Brian B. Maranville

Non-uniform fast Fourier Transform (NUFFT) and inverse NUFFT (INUFFT) algorithms, based on the Fast Multipole Method (FMM) are developed and tested. Our algorithms are based on a novel factorization of the FFT kernel, and are implemented…

Numerical Analysis · Computer Science 2016-11-30 Nail A. Gumerov , Ramani Duraiswami

Nonlinear Fourier division Multiplexing (NFDM) can be realized from modulating the discrete nonlinear spectrum of an $N$-solitary waveform. To generate an $N$-solitary waveform from desired discrete spectrum (eigenvalue and discrete…

Numerical Analysis · Mathematics 2016-05-23 Vahid Aref

The paper contains a systematic theory of the one-dimensional Double Hecke algebra, including applications to the difference Fourier transform, Macdonald's polynomials, Gaussian sums at roots of unity, and Verlinde algebras. The main result…

Quantum Algebra · Mathematics 2007-05-23 Ivan Cherednik , Viktor Ostrik

The Discrete Fourier Transform (DFT) is central to the analysis of uniformly sampled signals, yet many practical applications involve non-uniform sampling, requiring the Non-Uniform Discrete Fourier Transform (NUDFT). While quantum…

Quantum Physics · Physics 2026-03-18 Junaid Aftab , Yuehaw Khoo , Haizhao Yang

This paper discusses the properties and the numerical discretizations of the fractional substantial integral $$I_s^\nu f(x)=\frac{1}{\Gamma(\nu)} \int_{a}^x{\left(x-\tau\right)^{\nu-1}}e^{-\sigma(x-\tau)}{f(\tau)}d\tau,\nu>0, $$ and the…

Numerical Analysis · Mathematics 2015-02-24 Minghua Chen , Weihua Deng

The nonlinear Fourier transform (NFT), a powerful tool in soliton theory and exactly solvable models, is a method for solving integrable partial differential equations governing wave propagation in certain nonlinear media. The NFT…

Information Theory · Computer Science 2014-10-09 Mansoor I. Yousefi , Frank R. Kschischang

Being exact at both short- and long-time limits, the Gaussian approximation is widely used to calculate neutron incoherent inelastic scattering functions in liquids. However, to overcome a few numerical difficulties, extra physical…

Computational Physics · Physics 2022-07-27 Rong Du , Xiao-Xiao Cai

In this note, we study the convergence from the discrete to the continuous non-linear Fourier transform. Relations between spectral problems and questions in complex function theory provide a new approach to the study of scattering problems…

Classical Analysis and ODEs · Mathematics 2024-08-16 Ashley R. Zhang

We unify the discrete Fourier transform (DFT), discrete cosine transform (DCT), Walsh-Hadamard, Haar wavelet, Karhunen-Lo\`eve transform, and several others along with their continuous counterparts (Fourier transform, Fourier series,…

Signal Processing · Electrical Eng. & Systems 2026-05-19 Mitchell A. Thornton

This paper introduces the theory and hardware implementation of two new algorithms for computing a single component of the discrete Fourier transform. In terms of multiplicative complexity, both algorithms are more efficient, in general,…

Discrete Mathematics · Computer Science 2018-01-24 G. Jerônimo da Silva , R. M. Campello de Souza , H. M. de Oliveira