English
Related papers

Related papers: On semifast Fourier transform algorithms

200 papers

We define an approximate version of the Fourier transform on $2^L$ elements, which is computationally attractive in a certain setting, and which may find application to the problem of factoring integers with a quantum computer as is…

Quantum Physics · Physics 2007-05-23 D. Coppersmith

Fast Fourier Transforms (FFTs) are exploited in a wide variety of fields ranging from computer science to natural sciences and engineering. With the rising data production bandwidths of modern FFT applications, judging best which…

Performance · Computer Science 2017-07-12 Peter Steinbach , Matthias Werner

We mostly survey results concerning the $L^2$ boundedness of oscillatory and Fourier integral operators. This article does not intend to give a broad overview; it mainly focusses on a few topics directly related to the work of the authors.

Classical Analysis and ODEs · Mathematics 2007-05-23 Allan Greenleaf , Andreas Seeger

The Fast Fourier Transform (FFT) over a finite field $\mathbb{F}_q$ computes evaluations of a given polynomial of degree less than $n$ at a specifically chosen set of $n$ distinct evaluation points in $\mathbb{F}_q$. If $q$ or $q-1$ is a…

Computational Complexity · Computer Science 2023-10-24 Songsong Li , Chaoping Xing

We calculate the local Fourier transforms for formal connections. In particular, we verify an analogous conjecture suggested in Laumon's paper: "Transformation de Fourier, constantes d'equations fonctionnelles et conjecture de Weil, 2.6.3".

Algebraic Geometry · Mathematics 2007-07-03 Jiangxue Fang

In this paper we describe the Greens relations on the semigroup of bi-ideals of ordered full transformation semigroup in terms of Greens relations of ordered full transformation semigroup on a set.

Group Theory · Mathematics 2023-12-05 Minnumol P K , P G Romeo

We describe explicit algorithms for factoring q-difference operators and solving q-difference equations. These are well known results, presented in a "concrete" form. ----- Nous decrivons des algorithmes explicites pour la factorisation…

Quantum Algebra · Mathematics 2010-03-25 Jacques Sauloy

We give several algorithms addressing computations of intersections of conjugate subgroups.

Group Theory · Mathematics 2018-11-13 Rita Gitik

In this paper we introduce and experimentally compare alternative algorithms to join uncertain relations. Different algorithms are based on specific principles, e.g., sorting, indexing, or building intermediate relational tables to apply…

Databases · Computer Science 2012-11-02 Matteo Magnani , Danilo Montesi

We characterize the category of co-semi-analytic functors and describe an action of semi-analytic functors on co-semi-analytic functors.

Category Theory · Mathematics 2013-05-15 Marek Zawadowski

A brief description of the relations between the factorization method in quantum mechanics, self-similar potentials, integrable systems and the theory of special functions is given. New coherent states of the harmonic oscillator related to…

Quantum Physics · Physics 2021-04-14 V. P. Spiridonov

This review article was first published in 2008 as chapter 11 in the book "Fast Fourier Transforms," edited by C. S. Burrus, for the Connexions project at Rice University, which is sadly no longer online. It gives a high-level overview of…

Numerical Analysis · Mathematics 2026-03-02 Steven G. Johnson , Matteo Frigo

Fourier and fractional-Fourier transformations are widely used in theoretical physics. In this paper we make quantum perspectives and generalization for the fractional Fourier transformation (FrFT). By virtue of quantum mechanical…

Mathematical Physics · Physics 2014-08-26 Jun-Hua Chen , Hong-Yi Fan

We describe general methods for enumerating subsemigroups of finite semigroups and techniques to improve the algorithmic efficiency of the calculations. As a particular application we use our algorithms to enumerate all transformation…

Group Theory · Mathematics 2017-03-02 James East , Attila Egri-Nagy , James D. Mitchell

This text investigates relations between two well-known family of algorithms, matrix factorisations and recursive linear filters, by describing a probabilistic model in which approximate inference corresponds to a matrix factorisation…

Machine Learning · Statistics 2015-09-08 Ömer Deniz Akyıldız

Recent algorithmic advances in algebraic automata theory drew attention to semigroupoids (semicategories). These are mathematical descriptions of typed computational processes, but they have not been studied systematically in the context of…

Formal Languages and Automata Theory · Computer Science 2025-09-30 Attila Egri-Nagy , Chrystopher L. Nehaniv

In this paper, we prove both of the Titchmarsh theorems associated with Two-Sided Quaternionic Fourier Transform and we conclude about Short-Time Two-Sided Quaternionic Fourier Transform.

Classical Analysis and ODEs · Mathematics 2021-09-21 Hakim Monaim , Said Fahlaoui

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…

Numerical Analysis · Mathematics 2008-01-11 Lexing Ying

Some properties of the fractional Fourier transform, which is used in information processing, are presented in connection with the tomography transform of optical signals. Relation of the Green function of the quantum harmonic oscillator to…

Quantum Physics · Physics 2007-05-23 Margarita A. Man'ko

We consider semigroups of transformations (partial mappings defined on a set $A$) closed under the set-theoretic intersection of mappings treated as subsets of $A\times A$. On such semigroups we define two relations: the relation of…

Rings and Algebras · Mathematics 2013-05-28 W. A. Dudek , V. S. Trokhimenko
‹ Prev 1 3 4 5 6 7 10 Next ›