BUIR logo
Communities & Collections
All of BUIR
  • English
  • Türkçe
Log In
Please note that log in via username/password is only available to Repository staff.
Have you forgotten your password?
  1. Home
  2. Browse by Subject

Browsing by Subject "Rigorous solution"

Filter results by typing the first few letters
Now showing 1 - 6 of 6
  • Results Per Page
  • Sort Options
  • Loading...
    Thumbnail Image
    ItemOpen Access
    Analysis of Lossy Dielectric Objects with the Multilevel Fast Multipole Algorithm
    (IEEE, 2011) Ergul, O.; Gurel, Levent
    Rigorous solutions of electromagnetics problems involving lossy dielectric objects are considered. Problems are formulated with two recently developed formulations, namely, the combined-tangential formulation (CTF) and the electric and magnetic current combined-field integral equation (JMCFIE), and solved iteratively using the multilevel fast multipole algorithm (MLFMA). Accuracy and efficiency of solutions are compared for different objects and conductivity values. We show that iterative solutions of CTF are significantly accelerated as the conductivity increases and CTF becomes a good alternative to JMCFIE in terms of efficiency. Considering also its high accuracy, CTF seems to be a suitable formulation for the analysis of lossy dielectric objects.
  • Loading...
    Thumbnail Image
    ItemOpen Access
    An efficient parallel implementation of the multilevel fast multipole algorithm for rigorous solutions of large-scale scattering problems
    (IEEE, 2010) Ergül O.; Gürel, Levent
    We present the solution of large-scale scattering problems discretized with hundreds of millions of unknowns. The multilevel fast multipole algorithm (MLFMA) is parallelized using the hierarchical partitioning strategy on distributed-memory architectures. Optimizations and load-balancing algorithms are extensively used to improve parallel MLFMA solutions. The resulting implementation is successfully employed on modest parallel computers to solve scattering problems involving metallic objects larger than 1000λ and discretized with more than 300 million unknowns. © 2010 IEEE.
  • Loading...
    Thumbnail Image
    ItemOpen Access
    Hierarchical parallelization of the multilevel fast multipole algorithm (MLFMA)
    (IEEE, 2013) Gürel, Levent; Ergül, Özgür
    Due to its O(N log N) complexity, the multilevel fast multipole algorithm (MLFMA) is one of the most prized algorithms of computational electromagnetics and certain other disciplines. Various implementations of this algorithm have been used for rigorous solutions of large-scale scattering, radiation, and miscellaneous other electromagnetics problems involving 3-D objects with arbitrary geometries. Parallelization of MLFMA is crucial for solving real-life problems discretized with hundreds of millions of unknowns. This paper presents the hierarchical partitioning strategy, which provides a very efficient parallelization of MLFMA on distributed-memory architectures. We discuss the advantages of the hierarchical strategy over previous approaches and demonstrate the improved efficiency on scattering problems discretized with millions of unknowns. © 1963-2012 IEEE.
  • Loading...
    Thumbnail Image
    ItemOpen Access
    Rigorous solutions of large-scale dielectric problems with the parallel multilevel fast multipole algorithm
    (IEEE, 2011) Ergül, Özgür; Gürel, Levent
    We present fast and accurate solutions of large-scale electromagnetics problems involving three-dimensional homogeneous dielectric objects. Problems are formulated rigorously with the electric and magnetic current combined-field integral equation (JMCFIE) and solved iteratively with the multilevel fast multipole algorithm (MLFMA). In order to solve large-scale problems, MLFMA is parallelized efficiently on distributed-memory architectures using the hierarchical partitioning strategy. Efficiency and accuracy of the developed implementation are demonstrated on very large scattering problems discretized with tens of millions of unknowns. © 2011 IEEE.
  • Loading...
    Thumbnail Image
    ItemOpen Access
    Rigorous solutions of large-scale scattering problems discretized with hundreds of millions of unknowns
    (2009-09) Gürel, Levent; Ergül, Özgür
    We present fast and accurate solutions of large-scale scattering problems using a parallel implementation of the multilevel fast multipole algorithm (MLFMA). By employing a hierarchical partitioning strategy, MLFMA can be parallelized efficiently on distributed-memory architectures. This way, it becomes possible to solve very large problems discretized with hundreds of millions of unknowns. Effectiveness of the developed simulation environment is demonstrated on various scattering problems involving canonical and complicated objects. © 2009 IEEE.
  • Loading...
    Thumbnail Image
    ItemOpen Access
    Rigorous solutions of scattering problems involving red blood cells
    (IEEE, 2010) Ergül, Özgür; Arslan-Ergül, Ayça; Gürel, Levent
    We present rigorous solutions of scattering problems involving healthy red blood cells (RBCs) and diseased RBCs with deformed shapes. Scattering cross-section (SCS) values for different RBC shapes and different orientations are obtained accurately and efficiently using a sophisticated simulation environment based on the electric and magnetic current combinedfield integral equation and the multilevel fast multipole algorithm. Using SCS values, we determine strict guidelines to distinguish deformed RBCs from healthy RBCs and to diagnose related diseases.

About the University

  • Academics
  • Research
  • Library
  • Students
  • Stars
  • Moodle
  • WebMail

Using the Library

  • Collections overview
  • Borrow, renew, return
  • Connect from off campus
  • Interlibrary loan
  • Hours
  • Plan
  • Intranet (Staff Only)

Research Tools

  • EndNote
  • Grammarly
  • iThenticate
  • Mango Languages
  • Mendeley
  • Turnitin
  • Show more ..

Contact

  • Bilkent University
  • Main Campus Library
  • Phone: +90(312) 290-1298
  • Email: dspace@bilkent.edu.tr

Bilkent University Library © 2015-2025 BUIR

  • Privacy policy
  • Send Feedback