摘要
本文讨论了基于牛顿迭代算法的凹面光栅优化设计 ,它不同于传统的基于光程函数级数展开的设计思路 ,凹面光栅的结构通过两个由特殊设计要求选择的约束方程决定 ,光栅的刻槽位置可通过约束方程的数值求解得到 ,一般从选定的光栅顶点依次迭代求出。基于此方法讨论了无象差点结构凹面光栅的优化设计 ,并给出了数值模拟结果。关于此方法的进一步应用 ,其中包括不能通过光程函数法设计的例子 。
An optimum design of concave gratings is proposed based on Newton recursive algorithm, which differs from the traditional design based on a power-series expansion of the light-path function. The structure of a concave grating is represented by two constraint equations that may be chosen to meet some specific demands. From the grating pole, the facet positions are determined from the numerical solutions for the roots of two constraint equations in sequence. Anastigmatic mounts of concave gratings based on this algorithm are optimized, and numerical results are simulated. Further applications of this algorithm are also discussed, including the one that can not be designed with the theory of the power-series expansion of light-path function.
出处
《光电子．激光》
EI
CAS
CSCD
北大核心
2001年第12期1209-1213,共5页
Journal of Optoelectronics·Laser
基金
The work in part is supported by National Natural Science Foundation of China (6990 5 40 )
关键词
凹面光栅
牛顿迭代算法
波分复用器
优化设计
Computer simulation
Constraint theory
Design
Multiplexing equipment
Optimization
Recursive functions
