Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with fft
Search options not deleted
user 19371
The fast Fourier transform is an efficient algorithm to compute the discrete Fourier transform (DFT) and its inverse.
1
vote
Interpreting the FFT results of a structural vibration problem
In order to check system's resonance, we should get FRF(frequency response function), the ratio between input fft and output fft. Output signal's fft depends on input signal's signature. … Only with fft of output signal, we can't insist the pick of frequency is resonance. …
- 141