The following pages link to (Q3735040):
Displaying 41 items.
- Automatic derivation and implementation of fast convolution algorithms (Q597062) (← links)
- Fast polynomial multiplication and convolutions related to the discrete cosine transform (Q676009) (← links)
- The discrete \(\text{SU}(3)\) transform and its continuous extension for triangular lattices (Q864832) (← links)
- 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 (Q889185) (← links)
- Fast error-free algorithm for the determination of kernels of the periodic Volterra representation (Q913460) (← links)
- Error-free algorithms to solve special and general discrete systems of linear equations (Q941471) (← links)
- General operational calculus (Q1056859) (← links)
- Abelian semi-simple algebras and algorithms for the discrete Fourier transform (Q1060551) (← links)
- Transform decomposition in two-dimensional digital filter realization (Q1062955) (← links)
- The fast Hankel transform as a tool in the solution of the time dependent Schrödinger equation (Q1066650) (← links)
- Special algorithms for convolutions over Galois fields (Q1071810) (← links)
- An integral equation technique for the exterior and interior Neumann problem in toroidal regions (Q1077146) (← links)
- Implementation of a self-sorting in-place prime factor FFT algorithm (Q1087005) (← links)
- On the computational complexity of the general discrete Fourier transform (Q1094136) (← links)
- Banyan models for the parallel implementation of the fast Fourier transform algorithm (Q1107307) (← links)
- Queue length distributions from probability generating functions via discrete Fourier transforms (Q1119293) (← links)
- Fast generalized Fourier transforms (Q1123578) (← links)
- Exact deconvolution using number-theoretic transforms (Q1123581) (← links)
- Spectral methods in computational quantum mechanics (Q1184794) (← links)
- Communication efficient multi-processor FFT (Q1201720) (← links)
- On-line computation of convolutions (Q1262123) (← links)
- In-place self-sorting fast Fourier transform algorithm with local memory references (Q1299629) (← links)
- Symmetry stabilization for fast discrete monomial transforms and polynomial evaluation (Q1311327) (← links)
- Fast discrete transforms by means of eigenpolynomials (Q1311982) (← links)
- An error-free Levison algorithm to solve integer Toeplitz system (Q1322894) (← links)
- An error-free algorithm to solve a linear system of polynomial equations (Q1334719) (← links)
- A real-time parallel application: The detection of gravitational waves by a network of heterogeneous workstations (Q1384503) (← links)
- Exact algorithm of multidimensional circulant deconvolution (Q1774849) (← links)
- Nesting strategies for prime factor FFT algorithms (Q1825020) (← links)
- Fast unified computation of the multi-dimensional discrete sinusoidal transforms (Q1855852) (← links)
- Relax, but don't be too lazy (Q1866999) (← links)
- Approximate factorizations of Fourier matrices with nonequispaced knots (Q1874676) (← links)
- Stochastic minimization with adaptive memory (Q1893594) (← links)
- An algorithm to solve Hilbert systems of linear equations precisely (Q1908247) (← links)
- Generalization of the algebraic discrete Fourier transform with application to fast convolutions (Q2277806) (← links)
- Vector coding algorithms for multidimensional discrete Fourier transform (Q2475397) (← links)
- A fast algorithm for convolution integrals with space and time variant kernels (Q2495778) (← links)
- Fast algorithm for ``error-free'' convolution computation using Mersenne--Lucas codes (Q2497694) (← links)
- Determination of inverse volterra kernels in nonlinear discrete systems (Q3351210) (← links)
- (Q3701321) (← links)
- The differential Fourier transform method (Q5269166) (← links)
