An Algorithm for the Machine Calculation of Complex Fourier Series
From MaRDI portal
Publication:5332499
DOI10.2307/2003354zbMath0127.09002OpenAlexW4231896027WikidataQ55889742 ScholiaQ55889742MaRDI QIDQ5332499
James W. Cooley, John W. Tukey
Publication date: 1965
Full work available at URL: https://doi.org/10.2307/2003354
General theory of numerical methods in complex analysis (potential theory, etc.) (65E05) Algorithms in computer science (68W99) Software, source code, etc. for problems pertaining to harmonic analysis on Euclidean spaces (42-04)
Related Items (only showing first 100 items - show all)
Polynomial-division-based algorithms for computing linear recurrence relations ⋮ Analysis of a discrete-time queue with time-limited overtake priority ⋮ On solving LPN using BKW and variants, Implementation and analysis ⋮ Lattice-based zero-knowledge arguments for additive and multiplicative relations ⋮ A fast algorithm for computing large Fibonacci numbers ⋮ Fourier series of half-range functions by smooth extension ⋮ Classification of scale-sensitive telematic observables for riskindividual pricing ⋮ The effect of tapering on the semiparametric estimators for nonstationary long memory processes ⋮ Even faster integer multiplication ⋮ A geometric nonuniform fast Fourier transform ⋮ A spectral solver for evolution problems with spatial \(\mathbb S^3\)-topology ⋮ Optimized spatial matrix representations of quantum Hamiltonians ⋮ A decomposition method with minimum communication amount for parallelization of multi-dimensional FFTs ⋮ Five-step FFT algorithm with reduced computational complexity ⋮ On a construction of fast direct solvers. ⋮ Representation of the Fourier transform by Fourier series ⋮ Reconstructing a function on the sphere from its means along vertical slices ⋮ Computational aspects of a method of stochastic approximation ⋮ Consistent pricing of VIX and equity derivatives with the \(4/2\) stochastic volatility plus jumps model ⋮ Matrix compression by common subexpression elimination ⋮ Hybrid continuum-particle method for fluctuating lipid bilayer membranes with diffusing protein inclusions ⋮ A Hermite-based shallow water solver for a thin ``ocean over a rotating sphere ⋮ The use of imprecise processing to improve accuracy in weather \& climate prediction ⋮ Augmented Lagrangian formulation of orbital-free density functional theory ⋮ A CQM-based BEM for transient heat conduction problems in homogeneous materials and FGMs ⋮ A new exact solution for pricing European options in a two-state regime-switching economy ⋮ Symmetry-based matrix factorization ⋮ A modified HOL priority scheduling discipline: performance analysis ⋮ Reduction of page swaps on the two dimensional transforms in a paging environment ⋮ Blind image deconvolution using a banded matrix method ⋮ Finding submasses in weighted strings with fast Fourier transform ⋮ Against the long-range spectral leakage of the cosine window family ⋮ Combining initial segments of lists ⋮ Exponential convergence of a spectral projection of the KdV equation ⋮ QTT-rank-one vectors with QTT-rank-one and full-rank Fourier images ⋮ Sparse representation based Fisher discrimination dictionary learning for image classification ⋮ Implementation of Lévy CARMA model in \texttt{yuima} package ⋮ Parallel algorithm for SWFFT using 3D data structure ⋮ Efficient algorithms for the discrete Gabor transform with a long FIR window ⋮ A divide and conquer method for polynomial zeros ⋮ Dynamic analysis of 3-D structures by a transformed boundary element method ⋮ Convergence of the pseudospectral method for the Ginzburg-Landau equation ⋮ Fast computation of spectral centroids ⋮ A kernel-based framework to tensorial data analysis ⋮ Determining angular frequency from images of rotating objects via a generalized fast Fourier transform ⋮ Parallel algorithms for some algebraic operations on polynomial equations ⋮ Identification problems in distributed parameter neuron models ⋮ Efficient and generic algorithm for rigorous integration forward in time of dPDEs. I ⋮ Computationally efficient database and spectral interpolation for fully plastic Taylor-type crystal plasticity calculations of face-centered cubic polycrystals ⋮ Value at ruin and tail value at ruin of the compound Poisson process with diffusion and efficient computational methods ⋮ A numerical study for the KdV and the good Boussinesq equations using Fourier Chebyshev tau meshless method ⋮ Representation-theoretical properties of the approximate quantum Fourier transform ⋮ The Fourier approximation of smooth but non-periodic functions from unevenly spaced data ⋮ Sampling theorem and discrete Fourier transform on the Riemann sphere ⋮ Heterogeneous architectures for computational intensive applications: a cost-effectiveness analysis ⋮ Toward a unified theory of sparse dimensionality reduction in Euclidean space ⋮ A new algebra of Toeplitz-plus-Hankel matrices and applications ⋮ System identification methods for (operational) modal analysis: review and comparison ⋮ Fast Fourier transform using matrix decomposition ⋮ A fast and well-conditioned spectral method for singular integral equations ⋮ Necklaces, convolutions, and \(X+Y\) ⋮ Existence and efficient construction of fast Fourier transforms on supersolvable groups ⋮ Numerical methods for Lévy processes ⋮ Discrete singular convolution-finite subdomain method for the solution of incompressible viscous flows ⋮ Improvement of the discrete cosine transform calculation by means of a recursive method ⋮ Similar basis function algorithm for numerical estimation of Fourier integrals ⋮ A high-performance fast Fourier transform algorithm for the Cray-2 ⋮ A Bayesian-optimal principle for learner-friendly adaptation in learning games ⋮ Combinatorial sublinear-time Fourier algorithms ⋮ On computing the distribution function for the Poisson binomial distribution ⋮ Unfolding the frequency spectrum for undersampled wideband data ⋮ Ultrahigh-performance FFTs for the CRAY-2 and CRAY Y-MP supercomputers ⋮ Efficient methods for grouping vectors into low-rank clusters ⋮ A simple and fast method for computing the Poisson binomial distribution function ⋮ Fast Fourier-Galerkin methods for solving singular boundary integral equations: Numerical integration and precondition ⋮ Combining the Hanning windowed interpolated FFT in both directions ⋮ Eliminating the picket fence effect of the fast Fourier transform ⋮ Computing Fourier transforms and convolutions of \(S_{n - 1}\)-invariant signals on \(S_n\) in time linear in \(n\) ⋮ Special-purpose computer for two-dimensional FFT ⋮ Obtaining the quantum Fourier transform from the classical FFT with QR decomposition ⋮ Vergleich von Abstiegsverfahren zur Nullstellenbestimmung bei Polynomen. (Comparison of descent methods for the calculation of zeros of polynomials) ⋮ Pseudo-spectral solution of nonlinear Schrödinger equations ⋮ A heterogeneous FMM for layered media Helmholtz equation. I: Two layers in \(\mathbb{R}^2\) ⋮ A spectral scheme for Kohn-Sham density functional theory of clusters ⋮ Higher-order finite-difference formulation of periodic orbital-free density functional theory ⋮ The systems analysis approach to mechanosensory coding ⋮ Triple-matrix product-based 2D systolic implementation of discrete Fourier transform ⋮ Differential equations with infinitely many derivatives and the Borel transform ⋮ Swimming dynamics near a wall in a weakly elastic fluid ⋮ A methodology for designing, modifying, and implementing Fourier transform algorithms on various architectures ⋮ Numerical inversion of the Laplace transform: a survey and comparison of methods ⋮ Discrete orthogonal function expansions for non-uniform grids using the fast Fourier transform ⋮ An order \(N \log N\) parallel solver for time-spectral problems ⋮ A fast and accurate algorithm for spherical harmonic analysis on HEALPix grids with applications to the cosmic microwave background radiation ⋮ Multiplierless lifting-based fast X transforms derived from fast Hartley transform factorization ⋮ Stability restrictions on time-stepsize for numerical integration of first-order partial differential equations ⋮ The construction of orthonormal bases diagonalizing the discrete Fourier transform ⋮ Improved upper complexity bounds for the discrete Fourier transform ⋮ On the complexity of skew arithmetic ⋮ A multiscale sub-linear time Fourier algorithm for noisy data
Cites Work
This page was built for publication: An Algorithm for the Machine Calculation of Complex Fourier Series