1. ScholarBank@NUS
  2. 1. Staff
  3. Staff Publications
Please use this identifier to cite or link to this item: https://scholarbank.nus.edu.sg/handle/10635/51254
DC FieldValue
dc.titleThe application of the generalized conjugate residual algorithm to accelerate the fast multipole method
dc.contributor.authorYuan, N.
dc.contributor.authorTat Soon Yeo
dc.contributor.authorLi, L.
dc.contributor.authorNie, X.
dc.date.accessioned2014-04-24T08:37:48Z
dc.date.available2014-04-24T08:37:48Z
dc.date.issued2001
dc.identifier.citationYuan, N.,Tat Soon Yeo,Li, L.,Nie, X. (2001). The application of the generalized conjugate residual algorithm to accelerate the fast multipole method. IEEE Antennas and Propagation Society, AP-S International Symposium (Digest) 3 : 778-781. ScholarBank@NUS Repository.
dc.identifier.issn15223965
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/51254
dc.description.abstractA generalized conjugate residual algorithm (GCR) was employed as the iterative method to accelerate the fast multipole method (FMM) for the study of interactions between groups of scatterers. The average iteration number was found to be about 82 when using zero initial guess and 53 when using the phase-corrected solution of the previous angle as the initial guess for the next angle. It was demonstrated that the technique reduced the iteration number significantly.
dc.sourceScopus
dc.typeConference Paper
dc.contributor.departmentSINGAPORE-MIT ALLIANCE
dc.contributor.departmentELECTRICAL & COMPUTER ENGINEERING
dc.description.sourcetitleIEEE Antennas and Propagation Society, AP-S International Symposium (Digest)
dc.description.volume3
dc.description.page778-781
dc.description.codenIAPSB
dc.identifier.isiutNOT_IN_WOS
Appears in Collections:Staff Publications

Show simple item record
Files in This Item:
There are no files associated with this item.

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.