Premium
Accelerating the iterative inverse scattering algorithms by using the fast recursive aggregate T‐matrix algorithm
Author(s) -
Wang Y. M.,
Chew W. C.
Publication year - 1992
Publication title -
radio science
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.371
H-Index - 84
eISSN - 1944-799X
pISSN - 0048-6604
DOI - 10.1029/91rs02633
Subject(s) - algorithm , iterative method , computational complexity theory , conjugate gradient method , inverse scattering problem , matrix (chemical analysis) , inversion (geology) , scattering , convergence (economics) , mathematics , computer science , inverse , inverse problem , optics , mathematical analysis , physics , geometry , materials science , composite material , paleontology , structural basin , economics , biology , economic growth
A review and a convergence analysis of the Born and distorted Born iterative methods are given. The fast recursive aggregate T‐matrix algorithm is reviewed and then applied to the solution of the direct scattering part in the iterative inverse scattering algorithms. Together with the conjugate gradient method in the inversion part of the iterative inverse scattering algorithms, the overall computational complexity for the iterative inverse scattering algorithms is reduced from O ( N 3 ) to O ( N 2 ), representing a significant reduction of their computational complexity. The resulting distorted Born iterative algorithm is demonstrated to have a high‐resolution ability of reconstructing one‐ or two‐pixel pulse objects.