File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1002/mop.1234
- Scopus: eid_2-s2.0-0035919969
- WOS: WOS:000169401800011
- Find via
Supplementary
- Citations:
- Appears in Collections:
Article: Interpolation of translation matrix in MLFMA
Title | Interpolation of translation matrix in MLFMA |
---|---|
Authors | |
Keywords | Iterative Solver Multilevel Fast Multipole Algorithm Numerical Methods |
Issue Date | 2001 |
Publisher | John Wiley & Sons, Inc. The Journal's web site is located at http://www3.interscience.wiley.com/cgi-bin/jhome/37176 |
Citation | Microwave And Optical Technology Letters, 2001, v. 30 n. 2, p. 109-114 How to Cite? |
Abstract | The translation matrix for the multilevel fast multipole algorithm (MLFMA) in an FISC (fast Illinois solver code) is calculated directly, and the complexity is O(N3/2), where N is the number of unknowns. For a problem with a small electrical size, the CPU time for calculating the translation matrix can be negligible. But for large problems the calculation time increases significantly. In this paper, we use interpolation to calculate the translation matrix, and the complexity is reduced to O(N). Different interpolation techniques are tested, and it is found that the Lagrange polynomial interpolation with high sampling rates is the best. The saving factor is 10 for the VFY218 at 4 GHz. © 2001 John Wiley & Sons, Inc. |
Persistent Identifier | http://hdl.handle.net/10722/182661 |
ISSN | 2023 Impact Factor: 1.0 2023 SCImago Journal Rankings: 0.376 |
ISI Accession Number ID | |
References |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Song, J | en_US |
dc.contributor.author | Chew, WC | en_US |
dc.date.accessioned | 2013-05-02T05:16:19Z | - |
dc.date.available | 2013-05-02T05:16:19Z | - |
dc.date.issued | 2001 | en_US |
dc.identifier.citation | Microwave And Optical Technology Letters, 2001, v. 30 n. 2, p. 109-114 | en_US |
dc.identifier.issn | 0895-2477 | en_US |
dc.identifier.uri | http://hdl.handle.net/10722/182661 | - |
dc.description.abstract | The translation matrix for the multilevel fast multipole algorithm (MLFMA) in an FISC (fast Illinois solver code) is calculated directly, and the complexity is O(N3/2), where N is the number of unknowns. For a problem with a small electrical size, the CPU time for calculating the translation matrix can be negligible. But for large problems the calculation time increases significantly. In this paper, we use interpolation to calculate the translation matrix, and the complexity is reduced to O(N). Different interpolation techniques are tested, and it is found that the Lagrange polynomial interpolation with high sampling rates is the best. The saving factor is 10 for the VFY218 at 4 GHz. © 2001 John Wiley & Sons, Inc. | en_US |
dc.language | eng | en_US |
dc.publisher | John Wiley & Sons, Inc. The Journal's web site is located at http://www3.interscience.wiley.com/cgi-bin/jhome/37176 | en_US |
dc.relation.ispartof | Microwave and Optical Technology Letters | en_US |
dc.subject | Iterative Solver | en_US |
dc.subject | Multilevel Fast Multipole Algorithm | en_US |
dc.subject | Numerical Methods | en_US |
dc.title | Interpolation of translation matrix in MLFMA | 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.doi | 10.1002/mop.1234 | en_US |
dc.identifier.scopus | eid_2-s2.0-0035919969 | en_US |
dc.relation.references | http://www.scopus.com/mlt/select.url?eid=2-s2.0-0035919969&selection=ref&src=s&origin=recordpage | en_US |
dc.identifier.volume | 30 | en_US |
dc.identifier.issue | 2 | en_US |
dc.identifier.spage | 109 | en_US |
dc.identifier.epage | 114 | en_US |
dc.identifier.isi | WOS:000169401800011 | - |
dc.publisher.place | United States | en_US |
dc.identifier.scopusauthorid | Song, J=7404788341 | en_US |
dc.identifier.scopusauthorid | Chew, WC=36014436300 | en_US |
dc.identifier.issnl | 0895-2477 | - |