Fast Fourier transform and convolution algorithms
convolutiondiscrete Fourier transformfast Fourier transformsdigital signal processingcomputational complexity theorypolynomial transformsnumber-theoretic transformsWinograd Fourier transform algorithmBruun algorithmRader-Brenner algorithm
Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Signal detection and filtering (aspects of stochastic processes) (60G35) Research exposition (monographs, survey articles) pertaining to numerical analysis (65-02) Numerical methods for trigonometric approximation and interpolation (65T40) Analysis of algorithms and problem complexity (68Q25) Discrete mathematics in relation to computer science (68R99) Arithmetic and combinatorial problems involving abstract finite groups (20D60) Trigonometric interpolation (42A15) Software, source code, etc. for problems pertaining to numerical analysis (65-04) Software, source code, etc. for problems pertaining to number theory (11-04) Software, source code, etc. for problems pertaining to field theory (12-04) Software, source code, etc. for problems pertaining to harmonic analysis on Euclidean spaces (42-04)
- A polynomial interpolation process at quasi-Chebyshev nodes with the FFT
- Precise multidimensional deconvolution using the polynomial algebra concept
- Assessing fast Fourier transform algorithms.
- Computing invariant sets of random differential equations using polynomial chaos
- Towards an Implementation of a Computer Algebra System in a Functional Language
- Efficient calculation of the worst-case error and (fast) component-by-component construction of higher order polynomial lattice rules
- Comparing methods and defining practical requirements for extracting harmonic tidal components from groundwater level measurements
- Derivation and analysis of fast bilinear algorithms for convolution
- Zur Algebraischen Diskreten Fourier-Transformation
- Fourier reconstruction in tomography
- Rapid ``algebraic Fourier transforms on uniformly distributed meshes
- Multiplication
- A Novel Approach Towards Degree and Walsh-Transform of Boolean Functions
- An algebra of arrays and almost perfect watermarks
- A low-rank approach to the computation of path integrals
- A review and a synthesis of the fast Fourier transform algorithms for exact analysis of discrete data
- ON INVERSES AND EIGENPAIRS OF PERIODIC TRIDIAGONAL TOEPLITZ MATRICES WITH PERTURBED CORNERS
- Two new algorithms for matrix multiplication and vector convolution
- Block decomposition structures for the fast modular implementation of two-dimensional digital filters
- On the solvability of certain discrete equations and related estimates of discrete operators
- The partial fast Fourier transform
- Improved upper complexity bounds for the discrete Fourier transform
- Nonlinear spectral characteristics of large deformation elasticity theory
- Index transforms for multidimensional DFT's and convolutions
- Generalized convolution as a tool for the multi-dimensional filtering tasks
- Discretization and FIR filtering of continuous linear systems with internal and external point delays
- Generalizing the discrete Fourier transform
- On one problem of calculating a two-dimensional convolution with an exponential kernel
- The explicit solutions for a class of fractional Fourier–Laplace convolution equations
- Combining computation and data transmission in the systems with switches
- A fast numerical method for two-dimensional Riesz space fractional diffusion equations on a convex bounded region
- Algorithms for numerical evaluation of the compound Poisson distribution
- The twenty-fourth Fermat number is composite
- Features of the computational implementation of the algorithm for estimating the Lyapunov exponents of systems with delay
- A fast algorithm for expansion over spherical harmonics
- Precise deconvolution using the Fermat number transform
- Parameter Determination for Complex Number-Theoretic Transforms Using Cyclotomic Polynomials
- Generating the Laguerre expansion coefficients by solving a one-dimensional transport equation
- Discrete Weighted Transforms and Large-Integer Arithmetic
- scientific article; zbMATH DE number 4009769 (Why is no real title available?)
- Self-correcting polynomial programs
- Computer implementation of efficient discrete-convolution algorithms
- New frameworks for Montgomery’s modular multiplication method
This page was built for publication: Fast Fourier transform and convolution algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1159974)
