File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Multilevel fast multipole algorithm for the discrete dipole approximation

TitleMultilevel fast multipole algorithm for the discrete dipole approximation
Authors
Issue Date2001
PublisherTaylor & Francis Ltd. The Journal's web site is located at http://www.tandfonline.com/toc/tewa20/current
Citation
Journal Of Electromagnetic Waves And Applications, 2001, v. 15 n. 11, p. 1447-1468 How to Cite?
AbstractThe discrete dipole approximation, originally developed by Purcell and Pennypacker is a quite general method for solving scattering from irregularly shaped targets and/or a cluster of targets. Computationally, the method requires the solution of large dense systems of linear equations and various iterative methods have been employed in the literature for the purpose. In this work, the multi-level fast multipole algorithm is used to compute the matrix-vector product in the iterative methods. This algorithm has O(N) complexity and thus makes it feasible to solve hundreds of thousands of unknowns. Different formulas that has been proposed in the literature for determining the dipole polarizabilities in the discrete dipole approximation are compared. The method is checked by computing the scattering from spherical targets.
Persistent Identifierhttp://hdl.handle.net/10722/182643
ISSN
2015 Impact Factor: 0.772
2015 SCImago Journal Rankings: 0.394
References

 

DC FieldValueLanguage
dc.contributor.authorKoç, Sen_US
dc.contributor.authorChew, WCen_US
dc.date.accessioned2013-05-02T05:16:14Z-
dc.date.available2013-05-02T05:16:14Z-
dc.date.issued2001en_US
dc.identifier.citationJournal Of Electromagnetic Waves And Applications, 2001, v. 15 n. 11, p. 1447-1468en_US
dc.identifier.issn0920-5071en_US
dc.identifier.urihttp://hdl.handle.net/10722/182643-
dc.description.abstractThe discrete dipole approximation, originally developed by Purcell and Pennypacker is a quite general method for solving scattering from irregularly shaped targets and/or a cluster of targets. Computationally, the method requires the solution of large dense systems of linear equations and various iterative methods have been employed in the literature for the purpose. In this work, the multi-level fast multipole algorithm is used to compute the matrix-vector product in the iterative methods. This algorithm has O(N) complexity and thus makes it feasible to solve hundreds of thousands of unknowns. Different formulas that has been proposed in the literature for determining the dipole polarizabilities in the discrete dipole approximation are compared. The method is checked by computing the scattering from spherical targets.en_US
dc.languageengen_US
dc.publisherTaylor & Francis Ltd. The Journal's web site is located at http://www.tandfonline.com/toc/tewa20/currenten_US
dc.relation.ispartofJournal of Electromagnetic Waves and Applicationsen_US
dc.titleMultilevel fast multipole algorithm for the discrete dipole approximationen_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.scopuseid_2-s2.0-0035175723en_US
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-0035175723&selection=ref&src=s&origin=recordpageen_US
dc.identifier.volume15en_US
dc.identifier.issue11en_US
dc.identifier.spage1447en_US
dc.identifier.epage1468en_US
dc.publisher.placeNetherlandsen_US
dc.identifier.scopusauthoridKoç, S=7003829699en_US
dc.identifier.scopusauthoridChew, WC=36014436300en_US

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats