An Algorithm for the Machine Calculation of Complex Fourier Series
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Sampling and discretization of the linear canonical transform
- Trim-to-coherence Fourier transform
- A frequency-domain approach for modelling transient elastodynamics using scaled boundary finite element method
- On the diagonalization of the discrete Fourier transform
- Panjer recursion versus FFT for compound distributions
- A fast and accurate analysis of the interacting cracks in linear elastic solids
- Application of FFT-based algorithms for large-scale universal kriging problems
- Self-sorting mixed-radix fast Fourier transforms
- A note on prime factor FFT algorithms
- Fast mixed-radix real Fourier transforms
- Statistics of the spectral densities of stationary stochastic processes
- Ring structure and the Fourier transform
- Abelian semi-simple algebras and algorithms for the discrete Fourier transform
- Baryzentrische Formeln zur Trigonometrischen Interpolation. I
- Gauss and the history of the fast Fourier transform
- On computing the distribution function for the Poisson binomial distribution
- POT4A - A program for the direct solution of Poisson's equation in complex geometries
- A simple and fast method for computing the Poisson binomial distribution function
- The fast Fourier transform and the numerical solution of one-dimensional boundary integral equations
- A mixed pseudospectral/finite difference method for the axisymmetric flow in a heated, rotating spherical shell
- Iterative methods for overflow queueing models. I
- A direct routing algorithm for the bit-reversal permutation on a shuffle- exchange network
- Representation of real discrete Fourier transform in terms of a new set of functions based upon Möbius inversion
- Ring structures and the discrete Fourier transform
- Implementation of a self-sorting in-place prime factor FFT algorithm
- Eigenfunction methods and nonlinear hyperbolic boundary value problems at resonance
- Index transforms for N-dimensional DFT's
- On the computational complexity of the general discrete Fourier transform
- Simulation of incompressible turbulent flows
- On the worst-case arithmetic complexity of approximating zeros of polynomials
- A special class of structured matrices constructed with the Kronecker product and its use for difference equations
- A remark on symmetric circulant matrices
- Domain decomposition algorithms for spectral methods
- Banyan models for the parallel implementation of the fast Fourier transform algorithm
- The equivalence of decimation in time and decimation in frequency in FFT computations
- Calculation of thermodynamic properties from a parametric integral equation
- A robust orthogonal algorithm for system identification and time-series analysis
- Truncation and accumulated errors in wave propagation
- Efficient parallel circuits and algorithms for division
- Matching patterns in strings subject to multi-linear transformations
- Efficient implementation of multidimensional fast Fourier transforms on a Cray X-MP
- Split-step spectral schemes for nonlinear Dirac systems
- Fast generalized Fourier transforms
- Fast Fourier transformation based on number theoretic transforms
- Performance of inhomogeneous and anisotropic filters in the visual system
- Compensation of the picture distortions of moving patterns typical for time filters
- Thermally induced vibrations of beam structures
- A software for evaluating local accuracy in the Fourier transform
- Numerical computation of the Fourier transform using Laguerre functions and the fast Fourier transform
- Barycentric formulas for interpolating trigonometric polynomials and their conjugates
- Computer model for bounded plasma
- Non-parametric methods of system identification
- Frequency domain versus time domain methods in system identification
- A floating-point residue arithmetic unit
- A numerical study of 2-D turbulence
- Matrix identities of the fast Fourier transform
- Solving elliptic boundary value problems by double sweep method
- Calculation of complex Fourier coefficients using natural splines
- Latent variable models for time series. A frequency domain approach with an application to the permanent income hypothesis
- Optimal properties of certain spectral density statistics
- The numerical solution of an elliptic P.D.E. with periodic boundary conditions in a rectangular region by the spectral resolution method
- Dynamic response of frameworks by numerical Laplace transform
- Hecke's theorem in quadratic reciprocity, finite nilpotent groups and the Cooley-Tukey algorithm
- Spectral multigrid methods for elliptic equations
- A simple derivation of Glassman's general N fast Fourier transform
- Invariant and geometric aspects of algebraic complexity theory. I
- Improved FFT-based numerical inversion of Laplace transforms via fast Hartley transform algorithm
- Discrete convolution with modulo operations
- A variable degree spectral collocation algorithm for the solution of nonlinear evolutionary equations
- The Fourier-series method for inverting transforms of probability distributions
- On the stability of solution methods for band Toeplitz systems
- Error approximation in the solution of a linear PDE initial-value problem
- Multiplication, division, and shift instructions in parallel random access machines
- A fast solver for the first biharmonic boundary value problem
- Fouriertransform on sparse grids with hierarchical bases
- On the accuracy of numerical Fourier transforms
- A numerical solution for the problem of an impacted fiber-reinforced viscoelastic half-space
- Practical nonlinear system analysis by Wiener kernel estimation in the frequency domain
- Elementare Darstellung der schnellen Fouriertransformation
- Redundancy techniques and fast algorithms for a special large linear system
- The complexity of group algebra computations
- The fast Fourier transform for general order
- Analysis of a steepest-descent image-matching algorithm
- The solution of Poisson's equation for isolated source distributions
- The kernel identification method (1910-1977)-review of theory, calculation, application, and interpretation
- An algorithm recursively computing the exact Fourier coefficients of B- splines with nonequidistant knots
- The Fast Fourier Transform by polynomial evaluation
- Improved estimates for multivariate complex-normal regression with application to analysis of linear time-invariant relation-ships
- Determining the final form of a linear dynamic econometric model
- Numerical Fourier and Bessel transforms in logarithmic variables
- The accurate solution of Poisson's equation by expansion in Chebyshev polynomials
- Fast algorithms for the conjugate periodic function
- Dynamics of wire boom oscillations on a spinning satellite part I, lagrangian equations of motion and transient response
- On the multiplicative complexity of the discrete Fourier transform
- On the number of active *-operations needed to compute the discrete Fourier transform
- Efficient computation of Fourier transforms on compact groups
- On the implementation of the Dirichlet-to-Neumann radiation condition for iterative solution of the Helmholtz equation
- In-place self-sorting fast Fourier transform algorithm with local memory references
- Wavelets and stochastic processes
- Effective algorithms with circulant-block matrices
This page was built for publication: An Algorithm for the Machine Calculation of Complex Fourier Series
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5332499)
