Fast noniterative steepest descent path algorithm for planar and quasi-planar patch geometries

摘要

The motivation in developing fast direct noniterative algorithms is first considered. The combination of the recursive T-matrix algorithms and the steepest descent path formulation is then discussed.