Pages that link to "Item:Q917259"

The following pages link to Fast Fourier transforms: A tutorial review and a state of the art (Q917259):

Displaying 34 items.

• Wavelet inpainting with the \(\ell_{0}\) sparse regularization (Q285527) (← links)
• Maximum likelihood estimation of stochastic frontier models by the Fourier transform (Q528038) (← links)
• Natural frequencies of nonlinear vibration of axially moving beams (Q547216) (← links)
• A program for performing exact quantum dynamics calculations using cylindrical polar coordinates: a nanotube application (Q603382) (← links)
• DFT spectrum-sparsity-based quasi-periodic signal identification and application (Q737021) (← links)
• Calculation scheme based on a weighted primitive: application to image processing transforms (Q836454) (← links)
• Five-step FFT algorithm with reduced computational complexity (Q845949) (← links)
• Computationally efficient database and spectral interpolation for fully plastic Taylor-type crystal plasticity calculations of face-centered cubic polycrystals (Q927839) (← links)
• Calibrated FFT-based density approximations for \(\alpha\)-stable distributions (Q959282) (← links)
• Improvement of the discrete cosine transform calculation by means of a recursive method (Q969952) (← links)
• Gaussian DCT coefficient models (Q1027805) (← links)
• A review and a synthesis of the fast Fourier transform algorithms for exact analysis of discrete data (Q1390968) (← links)
• Fast Fourier optimization (Q1762460) (← links)
• Construction of distinct discrete time scattering quantum walk formulations on the honeycomb lattice (Q1798058) (← links)
• Two classes of elliptic discrete Fourier transforms: properties and examples (Q1932833) (← links)
• Performance estimation when the distribution of inefficiency is unknown (Q2079433) (← links)
• An effective procedure for extracting the first few bridge frequencies from a test vehicle (Q2234172) (← links)
• Fast and memory-efficient algorithms for computing quadratic time-frequency distributions (Q2252158) (← links)
• Characterizing empirical mode decomposition algorithm using signal processing techniques (Q2312521) (← links)
• Seismic waveform inversion using the finite-difference contrast source inversion method (Q2336514) (← links)
• A new matrix approach to real FFTs and convolutions of length \(2^k\) (Q2369946) (← links)
• Frequency-domain features for ECG beat discrimination using grey relational analysis-based classifier (Q2426890) (← links)
• Vector coding algorithms for multidimensional discrete Fourier transform (Q2475397) (← links)
• The regularizing effect of the Golub-Kahan iterative bidiagonalization and revealing the noise level in the data (Q2655224) (← links)
• A comparison of algorithms for exact goodness-of-fit tests for multinomial data (Q4387693) (← links)
• Wavelet transforms versus Fourier transforms (Q4695330) (← links)
• A new superfast bit reversal algorithm (Q4797959) (← links)
• Fast matrix splitting iteration method for the linear system from spatial fractional diffusion equations (Q5027050) (← links)
• Fast Fourier transform revisited (Q5040771) (← links)
• Revised fast convolution (Q5040794) (← links)
• A COOLEY-TUKEY MODIFIED ALGORITHM IN FAST FOURIER TRANSFORM (Q5041825) (← links)
• pyFFS: A Python Library for Fast Fourier Series Computation and Interpolation with GPU Acceleration (Q5097592) (← links)
• Multilevel Optimal Transport: A Fast Approximation of Wasserstein-1 Distances (Q5147991) (← links)
• The Tangent FFT (Q5386108) (← links)