A class of very efficient iterative algorithms is presented for the analysis of planar scatterers at the very fine detail regime. The mechanisms causing slow convergence in these cases have been identified and their effect corrected in a newly introduced algorithm. Further convergence enhancement is achieved by one or two additional minimization steps. The resultant new algorithms converge very fast for problems with fine details sampled faster than 0.001/spl lambda/, where other methods fail.
展开▼
