An Algorithm for the Machine Calculation of Complex Fourier Series
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- On the complexity of multivariate polynomial division
- An efficient algorithm for cyclic convolution based on fast-polynomial and fast-W transforms
- Spectral multigrid methods for elliptic equations
- Matching patterns in strings subject to multi-linear transformations
- Combining initial segments of lists
- Bayesian adaptive estimation: the next dimension
- Sparsifying preconditioner for the Lippmann-Schwinger equation
- An optimal preconditioned FFT-accelerated finite element solver for homogenization
- An O(N) algorithm for computing expectation of N-dimensional truncated multi-variate normal distribution. I: Fundamentals
- Polynomial-division-based algorithms for computing linear recurrence relations
- A multilevel method for the resolution of a stochastic weakly damped nonlinear Schrödinger equation
- Eigenfunction methods and nonlinear hyperbolic boundary value problems at resonance
- Numerical analysis of dynamic stability of an isotropic plate by applying tools used in dynamics
- A multiscale FE-FFT framework for electro-active materials at finite strains
- Preconditioning for Nonsymmetry and Time-Dependence
- Two-server distributed ORAM with sublinear computation and constant rounds
- Error estimate of the u-series method for molecular dynamics simulations
- The arithmetic computational complexity of linear transforms
- The duality property of the discrete Fourier transform based on Simpson's rule
- A conversation with I. J. Good
- A new perspective on the normalization of invariant measures for loss networks on other product form systems.
- Tighter Fourier transform lower bounds
- Redundancy techniques and fast algorithms for a special large linear system
- Analysis of a steepest-descent image-matching algorithm
- The fast Fourier transform for general order
- Applied spectral analysis
- Polynomial modular product verification and its implications
- A spectral method algorithm for numerical simulations of gravitational fields
- A two-scale FE-FFT approach to nonlinear magneto-elasticity
- An algorithmically consistent macroscopic tangent operator for FFT-based computational homogenization
- Fast reconstruction of an original continuous series from a recurrence plot
- A software for evaluating local accuracy in the Fourier transform
- Fast Huygens sweeping methods for time-dependent Schrödinger equation with perfectly matched layers
- Back-projection diffusion: solving the wideband inverse scattering problem with diffusion models
- Fast direct isogeometric boundary element method for 3D potential problems based on HODLR matrix
- pyFFS: a Python library for fast Fourier series computation and interpolation with GPU acceleration
- The complexity of group algebra computations
- Scalable FFT processors and pipelined butterfly units
- An FFT performance model for optimizing general-purpose processor architecture
- Pseudospectral approximation to two-dimensional turbulence
- scientific article; zbMATH DE number 3581612 (Why is no real title available?)
- The Tangent FFT
- Time-domain computation of the response of composite layered anisotropic plates to a localized source
- Revisiting key decomposition techniques for FHE: simpler, faster and more generic
- Faster BGV bootstrapping for power-of-two cyclotomics through homomorphic NTT
- A robust orthogonal algorithm for system identification and time-series analysis
- Anharmonic Frequency Analysis
- On the complexity of skew arithmetic
- A multiscale sub-linear time Fourier algorithm for noisy data
- NFFT.jl: Generic and Fast Julia Implementation of the Nonequidistant Fast Fourier Transform
- A numerical study of the interaction between unsteay free-stream disturbances and localized variations in surface geometry
- Computing newforms using supersingular isogeny graphs
- Moments and Mellin transform of the asset price in Stein and Stein model and option pricing
- Fast computation of the multidimensional discrete Fourier transform and discrete backward Fourier transform on sparse grids
- Roundoff Error Analysis of the Fast Fourier Transform
- Error bounds for cumulative distribution functions of convolutions via the discrete Fourier transform
- Computer model for bounded plasma
- Optimization of multidigit multiplication based on discrete (Fourier, cosine, sine) transforms in the parallel computing model
- Efficient long-range convolutions for point clouds
- Thoughts on numerical and conceptual harmonic analysis
- Baryzentrische Formeln zur Trigonometrischen Interpolation. I
- Lattice-based zero-knowledge arguments for additive and multiplicative relations
- On computation of the Bessel function by summing up the series
- Dynamic analysis of 3-D structures by a transformed boundary element method
- Galerkin-Chebyshev approximation of Gaussian random fields on compact Riemannian manifolds
- In-place self-sorting fast Fourier transform algorithm with local memory references
- A general and fast convolution-based method for peridynamics: applications to elasticity and brittle fracture
- Improved upper complexity bounds for the discrete Fourier transform
- High-order implicit Runge-Kutta Fourier pseudospectral methods for wave equations
- Index transforms for N-dimensional DFT's
- Semi-analytical exponential RKN integrators for efficiently solving high-dimensional nonlinear wave equations based on FFT techniques
- Fourier-accelerated nodal solvers (FANS) for homogenization problems
- The quantum Fourier transform based on quantum vision representation
- Improved estimates for multivariate complex-normal regression with application to analysis of linear time-invariant relation-ships
- The Fast Fourier Transform by polynomial evaluation
- Determining the final form of a linear dynamic econometric model
- A new algorithm for computing orthogonal polynomials
- Normalizing basis functions: approximate stationary models for large spatial data
- How to compress encrypted data
- When NTT meets Karatsuba: preprocess-then-NTT technique revisited
- Simulation of incompressible turbulent flows
- Functional central limit theorems for rough volatility
- A Fourier-accelerated volume integral method for elastoplastic contact
- Implementing the tangent Graeffe root finding method
- FOLEAGE: \(\mathbb{F}_4\)OLE-based multi-party computation for Boolean circuits
- Special-purpose computer for two-dimensional FFT
- Quantum vision representations and multi-dimensional quantum transforms
- A divide and conquer method for polynomial zeros
- A low-complexity algorithm to search for Legendre pairs
- scientific article; zbMATH DE number 7370604 (Why is no real title available?)
- An FFT-based fast gradient method for elastic and inelastic unit cell homogenization problems
- Mathematical modeling and numerical simulation of two-phase flows using Fourier pseudospectral and front-tracking methods: the proposition of a new method
- On polarization-based schemes for the FFT-based computational homogenization of inelastic materials
- Improvement of the discrete cosine transform calculation by means of a recursive method
- Similar basis function algorithm for numerical estimation of Fourier integrals
- Ultrahigh-performance FFTs for the CRAY-2 and CRAY Y-MP supercomputers
- An implementation of parallel number-theoretic transform using Intel AVX-512 instructions
- A new superfast bit reversal algorithm
- Clenshaw-Curtis algorithms for an efficient numerical approximation of singular and highly oscillatory Fourier transform integrals
- The complexity of computing (almost) orthogonal matrices with \(\varepsilon\)-copies of the Fourier transform
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)
