File Download
There are no files associated with this item.
Supplementary
-
Citations:
- Scopus: 0
- Appears in Collections:
Conference Paper: A fast algorithm for electrically small composite objects
| Title | A fast algorithm for electrically small composite objects |
|---|---|
| Authors | |
| Issue Date | 2004 |
| Publisher | I E E E. The Journal's web site is located at http://www.ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1000033 |
| Citation | Ieee Antennas And Propagation Society, Ap-S International Symposium (Digest), 2004, v. 4, p. 3960-3963 How to Cite? |
| Abstract | A multi-tree scheme to apply low-frequency multilevel fast multipole algorithm (LF-MLFMA) to electrically small composite objects, is described. An implementation of basis rearrangement is also presented to make the algorithm stable and capable of solving problems with large number of unknowns. For the scalar potential part in impedance matrix, divergence is taken on tree (RWG) basis to represent charges. When number of unknowns increases, the iteration count increases and eventually iterative solver fails to converge. The interactions between single patches are calculated by applying LF-MLFMA with O(N) CPU time and memory usage. |
| Persistent Identifier | http://hdl.handle.net/10722/182992 |
| ISSN | |
| References |
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Chu, Y | en_US |
| dc.contributor.author | Chew, WC | en_US |
| dc.date.accessioned | 2013-05-02T05:18:00Z | - |
| dc.date.available | 2013-05-02T05:18:00Z | - |
| dc.date.issued | 2004 | en_US |
| dc.identifier.citation | Ieee Antennas And Propagation Society, Ap-S International Symposium (Digest), 2004, v. 4, p. 3960-3963 | en_US |
| dc.identifier.issn | 1522-3965 | en_US |
| dc.identifier.uri | http://hdl.handle.net/10722/182992 | - |
| dc.description.abstract | A multi-tree scheme to apply low-frequency multilevel fast multipole algorithm (LF-MLFMA) to electrically small composite objects, is described. An implementation of basis rearrangement is also presented to make the algorithm stable and capable of solving problems with large number of unknowns. For the scalar potential part in impedance matrix, divergence is taken on tree (RWG) basis to represent charges. When number of unknowns increases, the iteration count increases and eventually iterative solver fails to converge. The interactions between single patches are calculated by applying LF-MLFMA with O(N) CPU time and memory usage. | en_US |
| dc.language | eng | en_US |
| dc.publisher | I E E E. The Journal's web site is located at http://www.ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1000033 | en_US |
| dc.relation.ispartof | IEEE Antennas and Propagation Society, AP-S International Symposium (Digest) | en_US |
| dc.title | A fast algorithm for electrically small composite objects | en_US |
| dc.type | Conference_Paper | 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-4544347305 | en_US |
| dc.relation.references | http://www.scopus.com/mlt/select.url?eid=2-s2.0-4544347305&selection=ref&src=s&origin=recordpage | en_US |
| dc.identifier.volume | 4 | en_US |
| dc.identifier.spage | 3960 | en_US |
| dc.identifier.epage | 3963 | en_US |
| dc.publisher.place | United States | en_US |
| dc.identifier.scopusauthorid | Chu, Y=8688952100 | en_US |
| dc.identifier.scopusauthorid | Chew, WC=36014436300 | en_US |
| dc.identifier.issnl | 1522-3965 | - |