首页 | 本学科首页   官方微博 | 高级检索  
     检索      

复化辛普森法和傅里叶法在衍射计算上的比较
引用本文:侯红方,吕晓旭,钟丽云.复化辛普森法和傅里叶法在衍射计算上的比较[J].光学与光电技术,2007,5(3):8-12.
作者姓名:侯红方  吕晓旭  钟丽云
作者单位:1. 昆明理工大学激光研究所,昆明,650051
2. 华南师范大学信息光电子科技学院,广州,510006
3. 暨南大学生命科学技术学院,广州,510632
摘    要:通过快速傅里叶变换(FFT)法和复化辛普森法对衍射的数值进行计算,可以看出快速傅里叶变换法是一种积分变换法,而复化辛普森法则是迭代相加的方法.通过计算得出了FFT法的计算速度高于复化辛普森法,计算精度则远低于复化辛普森法;复化辛普森法适合近距离菲涅尔衍射和近场衍射,而FFT法不适合.

关 键 词:衍射  快速傅里叶变换  复化辛普森  数值计算
文章编号:1672-3392(2007)03-0008-05
收稿时间:2006/11/13
修稿时间:2006-11-132007-03-01

Comparison Between the Methods of Iterative Simpson and FFT in Diffraction
HOU Hong-fang,L Xiao-xu,ZHONG Li-yun.Comparison Between the Methods of Iterative Simpson and FFT in Diffraction[J].optics&optoelectronic technology,2007,5(3):8-12.
Authors:HOU Hong-fang  L Xiao-xu  ZHONG Li-yun
Institution:1 Laser Institute of Faculty of Science, Kunming University of Science and Technology, Kunming 650051, China; 2 School of Information and Optoelectronics Science and Engineering, South China Normal University, Guangzhou 510006, China; 3 College of Life Science and Technology, Jinan University, Guangzhou 510632, China
Abstract:There are many methods in diffraction numerical computing, and different method is applicable to different scope. In these methods, Fast Fourier transform (FFT) method and iterative Simpson method are commonly used. From the definition of the two methods, FFT is a kind of integral transform, while iterative Simpson is a method of iterative addition. The computing results show that the computing speed of FFT method is more rapid than iterative Simpson method, the computing precision of FFT method is lower than iterative Simpson method. The iterative Simpson method can be used in near distance Fresnel diffraction and near field diffraction, but the FFT method isn't suitable for it.
Keywords:diffraction  fast Fourier transform  iterative Simpson  numerical computing
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号