scientific article; zbMATH DE number 3967873
From MaRDI portal
Publication:3735040
Recommendations
- scientific article; zbMATH DE number 3926790
- Fast Fourier transform: algorithms and applications
- scientific article; zbMATH DE number 1134974
- scientific article; zbMATH DE number 3956396
- scientific article; zbMATH DE number 4007688
- scientific article; zbMATH DE number 796291
- On a fast algorithm for computing the Fourier transform
- scientific article; zbMATH DE number 195038
- scientific article; zbMATH DE number 44502
- scientific article; zbMATH DE number 24367
Cited in
(42)- General operational calculus
- Abelian semi-simple algebras and algorithms for the discrete Fourier transform
- Transform decomposition in two-dimensional digital filter realization
- The fast Hankel transform as a tool in the solution of the time dependent Schrödinger equation
- Special algorithms for convolutions over Galois fields
- An integral equation technique for the exterior and interior Neumann problem in toroidal regions
- Implementation of a self-sorting in-place prime factor FFT algorithm
- On the computational complexity of the general discrete Fourier transform
- Banyan models for the parallel implementation of the fast Fourier transform algorithm
- Queue length distributions from probability generating functions via discrete Fourier transforms
- Fast generalized Fourier transforms
- Exact deconvolution using number-theoretic transforms
- Spectral methods in computational quantum mechanics
- Communication efficient multi-processor FFT
- On-line computation of convolutions
- In-place self-sorting fast Fourier transform algorithm with local memory references
- Symmetry stabilization for fast discrete monomial transforms and polynomial evaluation
- Fast discrete transforms by means of eigenpolynomials
- An error-free Levison algorithm to solve integer Toeplitz system
- An error-free algorithm to solve a linear system of polynomial equations
- A real-time parallel application: The detection of gravitational waves by a network of heterogeneous workstations
- Exact algorithm of multidimensional circulant deconvolution
- Nesting strategies for prime factor FFT algorithms
- Fast unified computation of the multi-dimensional discrete sinusoidal transforms
- Relax, but don't be too lazy
- Approximate factorizations of Fourier matrices with nonequispaced knots
- Stochastic minimization with adaptive memory
- An algorithm to solve Hilbert systems of linear equations precisely
- Generalization of the algebraic discrete Fourier transform with application to fast convolutions
- Vector coding algorithms for multidimensional discrete Fourier transform
- A fast algorithm for convolution integrals with space and time variant kernels
- Fast algorithm for ``error-free convolution computation using Mersenne--Lucas codes
- Determination of inverse volterra kernels in nonlinear discrete systems
- scientific article; zbMATH DE number 3926792 (Why is no real title available?)
- The differential Fourier transform method
- Automatic derivation and implementation of fast convolution algorithms
- Fast polynomial multiplication and convolutions related to the discrete cosine transform
- Multidimensional Fourier interpolation and complexity of the fast Fourier transform
- The discrete \(\text{SU}(3)\) transform and its continuous extension for triangular lattices
- Matrices of small Toeplitz rank, certain representations of the solution to an unstable system of linear equations with Toeplitz coefficient matrices, and related fast algorithms for solving such systems
- Fast error-free algorithm for the determination of kernels of the periodic Volterra representation
- Error-free algorithms to solve special and general discrete systems of linear equations
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3735040)
