arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 0711.0368astro-ph
收藏

Lyot型日冕传播的快速计算

Fast computation of Lyot-style coronagraph propagation

Remi Soummer, Laurent Pueyo, Anand Sivaramakrishnan, Robert J. Vanderbei

摘要:

我们提出了一种新的方法,通过Lyot式日冕仪使用有限掩模的数值传播。日冕模拟的标准方法涉及非常大的阵列的快速傅立叶变换(FFT),并且计算能力是分段的极大望远镜(ELT)上的日冕仪的设计和公差的问题,以处理速度和存储器要求。我们的方法结合了半解析方法与非基于FFT的傅立叶变换算法。它可以实现快速和内存高效的计算,而无需引入任何额外的近似。对于从光瞳到Lyot平面的传播,基于计算成本的典型速度改进为大约10到50,所需的存储器减少30到60倍。我们的方法使得有可能进行数值coronagraphic研究,即使在ELTS的情况下,使用当代商业笔记本电脑,或任何标准的商业工作站计算机。

英文摘要:

We present a new method for numerical propagation through Lyot-style coronagraphs using finite occulting masks. Standard methods for coronagraphic simulations involve Fast Fourier Transforms (FFT) of very large arrays, and computing power is an issue for the design and tolerancing of coronagraphs on segmented Extremely Large Telescopes (ELT) in order to handle both the speed and memory requirements. Our method combines a semi-analytical approach with non-FFT based Fourier transform algorithms. It enables both fast and memory-efficient computations without introducing any additional approximations. Typical speed improvements based on computation costs are of about ten to fifty for propagations from pupil to Lyot plane, with thirty to sixty times less memory needed. Our method makes it possible to perform numerical coronagraphic studies even in the case of ELTs using a contemporary commercial laptop computer, or any standard commercial workstation computer.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑