数值计算例表明，用快速汉克尔变换来模拟柱对称大型高功率激光放大系统中的光传输时，是一种非常有用的、快速的算法。
Numerical examples show that FHT is a useful fast algorithm to simulate the beam propagation through a large high power laser amplifier system with cylindrical symmetry.
本文按照这种算法总结出完成四柱汉诺塔游戏之最少步数的公式，并用数学归纳法证明了它。
According to that algorithm, this article puts forward a formula to calculate the number of movements necessary for the 4-peg Hanoi Tower problem, and proves it using mathematical induction.
汉诺塔问题： 有ABC三根柱子，A柱上有n个大小不等的盘子，大盘在下，小盘在上。
Tower of Hanoi problem: There are three pillars ABC, A column has n different sizes of plates, the broader market in the next, small cap on.
应用推荐