Accelerating the iterative inverse scattering algorithms by using the fast recursive aggregate T‐matrix algorithm

Y. M. Wang, W. C. Chew

Research output: Contribution to journalArticlepeer-review

Abstract

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(N3) to O(N2), 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.

Original languageEnglish (US)
Pages (from-to)109-116
Number of pages8
JournalRadio Science
Volume27
Issue number2
DOIs
StatePublished - Jan 1 1992

ASJC Scopus subject areas

  • Condensed Matter Physics
  • Earth and Planetary Sciences(all)
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Accelerating the iterative inverse scattering algorithms by using the fast recursive aggregate T‐matrix algorithm'. Together they form a unique fingerprint.

Cite this