File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Fast-forward solvers for the low-frequency detection of buried dielectric objects

TitleFast-forward solvers for the low-frequency detection of buried dielectric objects
Authors
KeywordsBuried Objects
Conjugate-Gradient Fast Fourier Transform (Cg-Fft) Algorithm
Cyclic Convolution
Cyclic Correlation
Fast Extended Born Approximation
Half Space
Low-Frequency Numerical Simulation
Issue Date2003
Citation
Ieee Transactions On Geoscience And Remote Sensing, 2003, v. 41 n. 9 PART I, p. 2026-2036 How to Cite?
AbstractIt is known that the extended Born approximation (ExBorn) is much faster than the method of moments (MoM) in the study of electromagnetic scattering by three-dimensional (3-D) dielectric objects, while it is much more accurate than the Born approximation at low frequencies. Hence, it is more applicable in the low-frequency numerical simulation tools. However, the conventional ExBorn is still too slow to solve large-scale problems because it requires O(N2) computational load, where N is the number of unknowns. In this paper, a fast ExBorn algorithm is proposed for the numerical simulation of 3-D dielectric objects buried in a lossy earth. When the buried objects are discretized with uniform rectangular mesh and the Green's functions are extended appropriately, the computational load can be reduced to O(N log N) using the cyclic convolution, cyclic correlation, and fast Fourier transform (FFT). Numerical analysis shows that the fast ExBorn provides good approximations if the buried target has a small or moderate contrast. If the contrast is large, however, ExBorn will be less accurate. In this case, a preconditioned conjugate-gradient FFT (CG-FFT) algorithm is developed, where the solution of the fast ExBorn is chosen as the initial guess and the preconditioner. Numerical results are given to test the validity and efficiency of the fast algorithms.
Persistent Identifierhttp://hdl.handle.net/10722/182685
ISSN
2015 Impact Factor: 3.36
2015 SCImago Journal Rankings: 1.975
ISI Accession Number ID
References

 

DC FieldValueLanguage
dc.contributor.authorCui, TJen_US
dc.contributor.authorChew, WCen_US
dc.contributor.authorAydiner, AAen_US
dc.contributor.authorZhang, YHen_US
dc.date.accessioned2013-05-02T05:16:26Z-
dc.date.available2013-05-02T05:16:26Z-
dc.date.issued2003en_US
dc.identifier.citationIeee Transactions On Geoscience And Remote Sensing, 2003, v. 41 n. 9 PART I, p. 2026-2036en_US
dc.identifier.issn0196-2892en_US
dc.identifier.urihttp://hdl.handle.net/10722/182685-
dc.description.abstractIt is known that the extended Born approximation (ExBorn) is much faster than the method of moments (MoM) in the study of electromagnetic scattering by three-dimensional (3-D) dielectric objects, while it is much more accurate than the Born approximation at low frequencies. Hence, it is more applicable in the low-frequency numerical simulation tools. However, the conventional ExBorn is still too slow to solve large-scale problems because it requires O(N2) computational load, where N is the number of unknowns. In this paper, a fast ExBorn algorithm is proposed for the numerical simulation of 3-D dielectric objects buried in a lossy earth. When the buried objects are discretized with uniform rectangular mesh and the Green's functions are extended appropriately, the computational load can be reduced to O(N log N) using the cyclic convolution, cyclic correlation, and fast Fourier transform (FFT). Numerical analysis shows that the fast ExBorn provides good approximations if the buried target has a small or moderate contrast. If the contrast is large, however, ExBorn will be less accurate. In this case, a preconditioned conjugate-gradient FFT (CG-FFT) algorithm is developed, where the solution of the fast ExBorn is chosen as the initial guess and the preconditioner. Numerical results are given to test the validity and efficiency of the fast algorithms.en_US
dc.languageengen_US
dc.relation.ispartofIEEE Transactions on Geoscience and Remote Sensingen_US
dc.subjectBuried Objectsen_US
dc.subjectConjugate-Gradient Fast Fourier Transform (Cg-Fft) Algorithmen_US
dc.subjectCyclic Convolutionen_US
dc.subjectCyclic Correlationen_US
dc.subjectFast Extended Born Approximationen_US
dc.subjectHalf Spaceen_US
dc.subjectLow-Frequency Numerical Simulationen_US
dc.titleFast-forward solvers for the low-frequency detection of buried dielectric objectsen_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.doi10.1109/TGRS.2003.813502en_US
dc.identifier.scopuseid_2-s2.0-0141940252en_US
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-0141940252&selection=ref&src=s&origin=recordpageen_US
dc.identifier.volume41en_US
dc.identifier.issue9 PART Ien_US
dc.identifier.spage2026en_US
dc.identifier.epage2036en_US
dc.identifier.isiWOS:000185419200014-
dc.publisher.placeUnited Statesen_US
dc.identifier.scopusauthoridCui, TJ=7103095470en_US
dc.identifier.scopusauthoridChew, WC=36014436300en_US
dc.identifier.scopusauthoridAydiner, AA=7004153439en_US
dc.identifier.scopusauthoridZhang, YH=15924551400en_US

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats