A windowed RATMA (recursive aggregate T-matrix algorithm) is discussed which can be used for both E/sub z/ and H/sub z/ wave scatterings. This algorithm has an O(n/sup 2/) complexity in two-dimensions and an O(N/sup 7/3/) complexity in three dimensions which is faster than the method of moments with Gaussian elimination, and yet produces a solution valid for all angles of incidence.
展开▼
机译：讨论了窗口式RATMA（递归聚合T矩阵算法），该算法可用于E / sub z /和H / sub z /波散射。该算法在二维上具有O（n / sup 2 /）复杂度，并且在三个维度上具有O（N / sup 7/3 /）复杂度，这比采用高斯消矩的矩方法要快，但仍能产生解决方案对所有入射角均有效。
展开▼
