Fast steepest descent path algorithm for analyzing scattering from two-dimensional objects


  • E. Michielssen,

  • W. C. Chew


A novel algorithm for accelerating the iterative solution of integral equations governing scattering from surfaces is presented. The proposed fast steepest descent path algorithm (FASDPA) complements previously developed fast solvers, notably the fast multipole method (FMM) and the matrix decomposition algorithm (MDA). Whereas the computational complexity per iteration of a two-level FMM and MDA is O(N3/2), the FASDPA permits a matrix-vector multiplication in O(N4/3) operations.