File Download
There are no files associated with this item.
Supplementary
-
Citations:
- Scopus: 0
- Appears in Collections:
Article: Discrete BCG-FFT algorithm for solving 3D inhomogeneous scatterer problems
Title | Discrete BCG-FFT algorithm for solving 3D inhomogeneous scatterer problems |
---|---|
Authors | |
Issue Date | 1995 |
Publisher | Taylor & Francis Ltd. The Journal's web site is located at http://www.tandfonline.com/toc/tewa20/current |
Citation | Journal Of Electromagnetic Waves And Applications, 1995, v. 9 n. 10, p. 1339-1357 How to Cite? |
Abstract | In this paper, an algorithm for computation of the scattered fields from three dimensional inhomogeneous dielectric scatterers is presented. In this method, the Galerkin's testing formulation of an integral equation for 3D electromagnetic (EM) fields is represented by a multi-input and multi-output linear system with known kernels. On a regular grid with rooftop basis functions, the kernels are discretized and accurately evaluated. Furthermore they are represented by Toeplitz matrices which dramatically reduces the storage and computational complexity in solving for the scattered fields. Also, the kernels are independent of the scattering configuration and the incident waves. For a given frequency, they can be evaluated once and for all. The biconjugate gradient (BCG) algorithm combined with fast Fourier transform (FFT) is applied to solve the discrete linear system iteratively. The memory required for this algorithm is of order N, and the computational complexity of the BCG process costs order N log N operations per iteration, where N is the number of 3D unknowns. Unlike previous approaches, no approximation is made when FFT is used to accelerate the matrix-vector multiplication. |
Persistent Identifier | http://hdl.handle.net/10722/182560 |
ISSN | 2023 Impact Factor: 1.2 2023 SCImago Journal Rankings: 0.376 |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Gan, H | en_US |
dc.contributor.author | Chew, WC | en_US |
dc.date.accessioned | 2013-05-02T05:15:52Z | - |
dc.date.available | 2013-05-02T05:15:52Z | - |
dc.date.issued | 1995 | en_US |
dc.identifier.citation | Journal Of Electromagnetic Waves And Applications, 1995, v. 9 n. 10, p. 1339-1357 | en_US |
dc.identifier.issn | 0920-5071 | en_US |
dc.identifier.uri | http://hdl.handle.net/10722/182560 | - |
dc.description.abstract | In this paper, an algorithm for computation of the scattered fields from three dimensional inhomogeneous dielectric scatterers is presented. In this method, the Galerkin's testing formulation of an integral equation for 3D electromagnetic (EM) fields is represented by a multi-input and multi-output linear system with known kernels. On a regular grid with rooftop basis functions, the kernels are discretized and accurately evaluated. Furthermore they are represented by Toeplitz matrices which dramatically reduces the storage and computational complexity in solving for the scattered fields. Also, the kernels are independent of the scattering configuration and the incident waves. For a given frequency, they can be evaluated once and for all. The biconjugate gradient (BCG) algorithm combined with fast Fourier transform (FFT) is applied to solve the discrete linear system iteratively. The memory required for this algorithm is of order N, and the computational complexity of the BCG process costs order N log N operations per iteration, where N is the number of 3D unknowns. Unlike previous approaches, no approximation is made when FFT is used to accelerate the matrix-vector multiplication. | en_US |
dc.language | eng | en_US |
dc.publisher | Taylor & Francis Ltd. The Journal's web site is located at http://www.tandfonline.com/toc/tewa20/current | en_US |
dc.relation.ispartof | Journal of Electromagnetic Waves and Applications | en_US |
dc.title | Discrete BCG-FFT algorithm for solving 3D inhomogeneous scatterer problems | en_US |
dc.type | Article | en_US |
dc.identifier.email | Chew, WC: wcchew@hku.hk | en_US |
dc.identifier.authority | Chew, WC=rp00656 | en_US |
dc.description.nature | link_to_subscribed_fulltext | en_US |
dc.identifier.scopus | eid_2-s2.0-0029518207 | en_US |
dc.identifier.volume | 9 | en_US |
dc.identifier.issue | 10 | en_US |
dc.identifier.spage | 1339 | en_US |
dc.identifier.epage | 1357 | en_US |
dc.publisher.place | Netherlands | en_US |
dc.identifier.scopusauthorid | Gan, H=36807480800 | en_US |
dc.identifier.scopusauthorid | Chew, WC=36014436300 | en_US |
dc.identifier.issnl | 0920-5071 | - |