Large-scale solutions of electromagnetics problems using the multilevel fast multipole algorithm and physical optics

buir.advisorİlday, F. Ömer
dc.contributor.authorHidayetoğlu, Mert
dc.date.accessioned2016-04-29T07:05:55Z
dc.date.available2016-04-29T07:05:55Z
dc.date.copyright2015-04
dc.date.issued2015-04
dc.date.submitted17-04-2015
dc.descriptionCataloged from PDF version of thesis.en_US
dc.descriptionIncludes bibliographical references (leaves 67-73).en_US
dc.descriptionThesis (M.S.): Bilkent University, Department of Electrical and Electronics Engineering, İhsan Doğramacı Bilkent University, 2015.en_US
dc.description.abstractIntegral equations provide full-wave (accurate) solutions of Helmholtz-type electromagnetics problems. The multilevel fast multipole algorithm (MLFMA) discretizes the equations and solves them numerically with O(NLogN) complexity, where N is the number of unknowns. For solving large-scale problems, MLFMA is parallelized on distributed-memory architectures. Despite the low complexity and parallelization, the computational requirements of MLFMA solutions grow immensely in terms of CPU time and memory when extremely-large geometries (in wavelengths) are involved. The thesis provides computational and theoretical techniques for solving large-scale electromagnetics problems with lower computational requirements. One technique is the out-of-core implementation for reducing the required memory via employing disk space for storing large data. Additionally, a pre-processing parallelization strategy, which eliminates memory bottlenecks, is presented. Another technique, MPI+OpenMP parallelization, uses distributed-memory and shared-memory schemes together in order to maintain the parallelization efficiency with high number of processes/threads. The thesis also includes the out-of-core implementation in conjunction with the MPI+OpenMP parallelization. With the applied techniques, full-wave solutions involving up to 1.3 billion unknowns are achieved with 2 TB memory. Physical optics is a high-frequency approximation, which provides fast solutions of scattering problems with O(N) complexity. A parallel physical optics algorithm is presented in order to achieve fast and approximate solutions. Finally, a hybrid integral-equation and physical-optics solution methodology is introduced.en_US
dc.description.provenanceSubmitted by Betül Özen (ozen@bilkent.edu.tr) on 2016-04-29T07:05:55Z No. of bitstreams: 1 mert_hidayetoglu_MS_thesis.pdf: 9562041 bytes, checksum: 180f2bc99b7499ba1b4b145ef7f20982 (MD5)en
dc.description.provenanceMade available in DSpace on 2016-04-29T07:05:55Z (GMT). No. of bitstreams: 1 mert_hidayetoglu_MS_thesis.pdf: 9562041 bytes, checksum: 180f2bc99b7499ba1b4b145ef7f20982 (MD5) Previous issue date: 2015-04en
dc.description.statementofresponsibilityby Mert Hidayetoğlu.en_US
dc.embargo.release2017-04-17
dc.format.extentxiii, 80 leaves : charts.en_US
dc.identifier.itemidB150015
dc.identifier.urihttp://hdl.handle.net/11693/29013
dc.language.isoEnglishen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectIntegral equationsen_US
dc.subjectMultilevel fast multipole algorithmen_US
dc.subjectPhysical opticsen_US
dc.subjectElectromagnetic scatteringen_US
dc.subjectParallel computingen_US
dc.subjectOut-of-core methoden_US
dc.titleLarge-scale solutions of electromagnetics problems using the multilevel fast multipole algorithm and physical opticsen_US
dc.title.alternativeÇok seviyeli hızlı çokkutup yöntemi ve fiziksel optik ile büyük ölçekli elektromanyetik problemlerin çözümlerien_US
dc.typeThesisen_US
thesis.degree.disciplineElectrical and Electronic Engineering
thesis.degree.grantorBilkent University
thesis.degree.levelMaster's
thesis.degree.nameMS (Master of Science)

Files

Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
mert_hidayetoglu_MS_thesis.pdf
Size:
9.12 MB
Format:
Adobe Portable Document Format
Description:
Full printable version
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description: