Fast steepest descent path algorithm for analyzing scattering from two-dimensional objects
Article first published online: 7 DEC 2012
Copyright 1996 by the American Geophysical Union.
Volume 31, Issue 5, pages 1215–1224, September-October 1996
How to Cite
1996), Fast steepest descent path algorithm for analyzing scattering from two-dimensional objects, Radio Sci., 31(5), 1215–1224, doi:10.1029/96RS01364., and (
- Issue published online: 7 DEC 2012
- Article first published online: 7 DEC 2012
- Manuscript Accepted: 2 MAY 1996
- Manuscript Received: 14 DEC 1995
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.