1. ScholarBank@NUS
  2. 1. Staff
  3. Staff Publications
Please use this identifier to cite or link to this item: https://doi.org/10.1163/156939303322519685
DC FieldValue
dc.titleMPI-based parallelized precorrected FFT algorithm for analyzing scattering by arbitrarily shaped three-dimensional objects - Abstract
dc.contributor.authorLi, L.-W.
dc.contributor.authorWang, Y.-J.
dc.contributor.authorLi, E.-P.
dc.date.accessioned2014-04-24T07:23:08Z
dc.date.available2014-04-24T07:23:08Z
dc.date.issued2003
dc.identifier.citationLi, L.-W., Wang, Y.-J., Li, E.-P. (2003). MPI-based parallelized precorrected FFT algorithm for analyzing scattering by arbitrarily shaped three-dimensional objects - Abstract. Journal of Electromagnetic Waves and Applications 17 (10) : 1489-1491. ScholarBank@NUS Repository. https://doi.org/10.1163/156939303322519685
dc.identifier.issn09205071
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/50984
dc.description.abstractIn this paper, how to parallelize the Pre-corrected FFT algorithm for solving the scattering problem of large scale is presented and discussed. The P-FFT technique developed by our group earlier was extended in the current analysis. To show the efficiency of the MPI-based parallelization algorithm, the experiment results are given in the latter part of the paper and various comparisons are made for such a demonstration.
dc.description.urihttp://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1163/156939303322519685
dc.sourceScopus
dc.typeArticle
dc.contributor.departmentELECTRICAL & COMPUTER ENGINEERING
dc.description.doi10.1163/156939303322519685
dc.description.sourcetitleJournal of Electromagnetic Waves and Applications
dc.description.volume17
dc.description.issue10
dc.description.page1489-1491
dc.description.codenJEWAE
dc.identifier.isiut000186226200012
Appears in Collections:Staff Publications

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

Google ScholarTM

Check

Altmetric


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