Eine Plattform für die Wissenschaft: Bauingenieurwesen, Architektur und Urbanistik
Computing Cumulative Number of Failures Using the Fast Fourier Transform
Predictive calculations of the accumulated number of failing parts during the ramp-up of mass production are reasonably straightforward. However, such estimations increase in the order of computational complexity as the resolution of data points increases. This paper provides an approach using the FFT algorithm to accelerate such computations.
Computing Cumulative Number of Failures Using the Fast Fourier Transform
Predictive calculations of the accumulated number of failing parts during the ramp-up of mass production are reasonably straightforward. However, such estimations increase in the order of computational complexity as the resolution of data points increases. This paper provides an approach using the FFT algorithm to accelerate such computations.
Computing Cumulative Number of Failures Using the Fast Fourier Transform
J. Inst. Eng. India Ser. B
Ramasamy, Deivaraja (Autor:in)
Journal of The Institution of Engineers (India): Series B ; 102 ; 465-467
01.06.2021
3 pages
Aufsatz (Zeitschrift)
Elektronische Ressource
Englisch
Diskrete Fourier-Transformation und Fast Fourier Transform
Springer Verlag | 2017
|Fast fourier transform using the PDP-11
TIBKAT | 1972
|Probability Analysis Method Using Fast Fourier Transform
British Library Conference Proceedings | 1996
|Probability analysis method using Fast Fourier transform and its application
British Library Online Contents | 1997
|Pulsed Photoacoustic Inspection of Metals Using the Fast Fourier Transform
British Library Online Contents | 1998
|