File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Accelerating the iterative inverse scattering algorithms by using the fast recursive aggregate T-matrix algorithm

TitleAccelerating the iterative inverse scattering algorithms by using the fast recursive aggregate T-matrix algorithm
Authors
Issue Date1992
Citation
Radio Science, 1992, v. 27 n. 2, p. 109-116 How to Cite?
AbstractA 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.
Persistent Identifierhttp://hdl.handle.net/10722/182521
ISSN
2015 Impact Factor: 1.273
2015 SCImago Journal Rankings: 1.072

 

DC FieldValueLanguage
dc.contributor.authorWang, YMen_US
dc.contributor.authorChew, WCen_US
dc.date.accessioned2013-05-02T05:15:42Z-
dc.date.available2013-05-02T05:15:42Z-
dc.date.issued1992en_US
dc.identifier.citationRadio Science, 1992, v. 27 n. 2, p. 109-116en_US
dc.identifier.issn0048-6604en_US
dc.identifier.urihttp://hdl.handle.net/10722/182521-
dc.description.abstractA 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.en_US
dc.languageengen_US
dc.relation.ispartofRadio Scienceen_US
dc.titleAccelerating the iterative inverse scattering algorithms by using the fast recursive aggregate T-matrix algorithmen_US
dc.typeArticleen_US
dc.identifier.emailChew, WC: wcchew@hku.hken_US
dc.identifier.authorityChew, WC=rp00656en_US
dc.description.naturelink_to_subscribed_fulltexten_US
dc.identifier.scopuseid_2-s2.0-0026829063en_US
dc.identifier.volume27en_US
dc.identifier.issue2en_US
dc.identifier.spage109en_US
dc.identifier.epage116en_US
dc.publisher.placeUnited Statesen_US
dc.identifier.scopusauthoridWang, YM=13310238600en_US
dc.identifier.scopusauthoridChew, WC=36014436300en_US

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats