Computational Electromagnetics Research Center (BİLCEM)

Permanent URI for this communityhttps://hdl.handle.net/11693/115608

Browse

Browsing Computational Electromagnetics Research Center (BİLCEM) by Author "Kazempour, Mahdi"

Filter results by typing the first few letters
Now showing 1 - 3 of 3
  • Thumbnail Image
    ItemOpen Access
    Algebraic acceleration and regularization of the source reconstruction method with the recompressed adaptive cross approximation
    (IEEE, 2014) Kazempour, Mahdi; Gürel, Levent
    We present a compression algorithm to accelerate the solution of source reconstruction problems that are formulated with integral equations and defined on arbitrary three-dimensional surfaces. This compression technique benefits from the adaptive cross approximation (ACA) algorithm in the first step. A further error-controllable recompression is applied after the ACA. The numerical results illustrate the efficiency and accuracy of the proposed method. © 2014 IEEE.
  • Thumbnail Image
    ItemOpen Access
    Fast solution of electromagnetic scattering problems with multiple excitations using the recompressed adaptive cross approximation
    (IEEE, 2014) Kazempour, Mahdi; Gürel, Levent
    We present an algebraic compression technique to accelerate the computation of multiple monostatic radar cross sections of arbitrary 3-D geometries. The method uses adaptive cross approximation, followed by a recompression technique to reduce the CPU time and the memory consumption. Each scattering problem due to a single excitation is solved with the multilevel fast multipole algorithm. The numerical results demonstrate the efficiency and accuracy of the proposed method. © 2014 IEEE.
  • Thumbnail Image
    ItemOpen Access
    Solution of low-frequency electromagnetics problems using hierarchical matrices
    (IEEE, 2013) Kazempour, Mahdi; Gürel, Levent
    Fast and accurate solutions of low-frequency electromagnetics problems are obtained with an iterative solver based on hierarchical matrices. Iterative solvers require matrix-vector multiplications (MVMs). The results show significant reductions both in CPU time and memory consumption compared to the O(N2) complexity of ordinary matrix filling and MVM.