Results 41 to 50 of about 316,193 (316)
Fast Fourier Transform Algorithms for the Nonlinear Shallow Water Equations
Discretization of the two dimensional nonlinear shallow water equations is done using pseudo-spectral methods with a translating vortex test case. First, the equations are modeled using Chebyshev differentiation with Fast Fourier Transform. The test case
Saumya PUTHENVEETTIL, Kyle MANDLI
doaj +1 more source
REVISED FAST FOURIER TRANSFORM
The problem of realisation of the Discrete Fourier Transform in on-line is analysed because of non-efficient consuming a time for a new recalculation of spectrum samples if one discrete-time signal sample or even some small portion of samples in period are replaced by new sample or by new samples, respectively.
openaire +5 more sources
A fast Fourier transform compiler [PDF]
The FFTW library for computing the discrete Fourier transform (DFT) has gained a wide acceptance in both academia and industry, because it provides excellent performance on a variety of machines (even competitive with or faster than equivalent libraries supplied by vendors).
openaire +2 more sources
An Ultra-Precise Fast Fourier Transform
The Fast Fourier Transform (FFT) is a cornerstone of digital signal processing, generating a computationally efficient estimate of the frequency content of a time series. Its limitations include: (1) information is only provided at discrete frequency steps, so further calculation, for example interpolation, may be required to obtain improved estimates ...
openaire +4 more sources
Temporal power modulation increases weld depth in high‐power laser beam welding of dissimilar round bars by nearly 20% compared to same average continuously welded welding power. The mechanism of action also applies to sheet welding and depends on the inertia of keyhole depth for the modulated laser beam power.
Jan Grajczak+7 more
wiley +1 more source
FourierPIM: High-throughput in-memory Fast Fourier Transform and polynomial multiplication
The Discrete Fourier Transform (DFT) is essential for various applications ranging from signal processing to convolution and polynomial multiplication. The groundbreaking Fast Fourier Transform (FFT) algorithm reduces DFT time complexity from the naive O(
Orian Leitersdorf+4 more
doaj
Using novel probe‐based metrics, this study evaluates lattice structures on criteria critical to cellular solid optimization. Triply‐periodic minimal surface (TPMS) lattices outperform other lattices, offering more predictable mechanical behavior in complex design spaces and, as a result, higher performance in optimized models.
Firas Breish+2 more
wiley +1 more source
Herein, silicon‐based nanoparticle coatings on X2CrNiMo17‐12‐2 metal powder are presented. The coating process scale, process parameters, nanoparticle size (65–200 nm) as well as the coating amount are discussed regarding powder properties. The surface roughness affects the flowability, while reflectance depends on the coating material and surface ...
Arne Lüddecke+4 more
wiley +1 more source
Fast non-uniform Fourier transform based regularization for sparse-view large-size CT reconstruction
Spare-view CT imaging is advantageous to decrease the radiation exposure, acquisition time and computational cost, but suffers from severe streak noise in reconstruction if the classical filter back projection method is employed.
Zhenglin Wang
doaj +1 more source
The study investigates 3D‐printed polylactic acid (PLA) composites with biodegradable bamboo and jute powder fillers. Mechanical, thermal, structural properties, and rheological behavior are discussed to evaluate composite performance. Morphological characterization indicates uniform dispersion and adhesion of the fillers in the PLA matrix with the ...
Vimukthi Dananjaya+4 more
wiley +1 more source