雷达FFT算法
卷积(计算机科学)
傅里叶变换
离散傅里叶变换(通用)
旋转因子
频谱泄漏
计算机科学
Cooley–Tukey FFT算法
计算
作者
Shuangbiao Liu,Qian Wang,Geng Liu
出处
期刊:Wear
[Elsevier BV]
日期:2000-08-28
卷期号:243 (1): 101-111
被引量:486
标识
DOI:10.1016/s0043-1648(00)00427-0
摘要
The fast Fourier transform (FFT) technology has been introduced into the process of contact analyses. However, a problem may occur at the borders of the domain due to a periodic error involved. In order to obtain reasonable results, an expedient treatment requires a computational physical domain much larger than the target domain at the cost of calculation efficiency. This paper studies the source of the error and investigates the methods that can help avoid this error and improve the efficiency. Discrete convolution and FFT (DC-FFT) is first adopted instead of the method of continuous convolution and Fourier transform for the contact problems. A few approaches based on the DC-FFT method are presented and numerical results are compared.
科研通智能强力驱动
Strongly Powered by AbleSci AI