Browsing by Subject "Electromagnetic wave scattering"

Now showing 1 - 20 of 43

Open Access
Accurate plane-wave excitation in the FDTD method
(IEEE, 1997) Gürel, Levent; Oğuz, Uğur; Arıkan, Orhan
Different techniques are developed to implement plane-wave excitation on the finite-difference time-domain (FDTD) method, such as the initial-condition, the hard-source, and the connecting-condition techniques, for the total-field/scattered field (TF/SF) formulation. In the TF/SF formulation, the incident field is computed and fed to the 3D FDTD grid on the boundary separating the total-field and the scattered-field regions. Since the incedent field is a known quantity, a closed-form expression can be evaluated on every point of this boundary. A more efficient way of computing the incedent field is by using an incedent-field array (IFA), which is a 1D FDTD grid set-up to numerically propagate the incedent field into the 3D FDTD.
Open Access
Analysis of circular reflectors by complex source-dual series approach
(IEEE, 1993-06-07) Oğuzer, Taner; Altıntaş, Ayhan; Nosich, A. L.
In the present paper, two dimensional circular reflector antennas are analyzed by a rigorous analytical-numerical technique for both E and H polarization cases. The method is used in combination with the complex source approach. The convergence of the solution is guaranteed and any desired accuracy can be obtained. Some principal results of reflector antennas are examined by the exact circular reflector solution.
Open Access
Application of signal-processing techniques to dipole excitations in the finite-difference time-domain method
(Taylor & Francis, 2002) Oğuz, U.; Gürel, Levent
The applications of discrete-time signal-processing techniques, such as windowing and filtering for the purpose of implementing accurate excitation schemes in the finite-difference time-domain (FDTD) method are demonstrated. The effects of smoothing windows of various lengths and digital lowpass filters of various bandwidths and characteristics are investigated on finite-source excitations of the FDTD computational domain. Both single-frequency sinusoidal signals and multifrequency arbitrary signals are considered.
Open Access
Application of signal-processing techniques to reduce the errors related to the FDTD excitations
(IEEE, 2001) Gürel, Levent; Oğuz, Uğur
A study on the reduction of the errors related to the finite-difference time-domain (FDTD) excitations was performed by employing signal-processing techniques. Plane-wave scattering problems were simulated. The improvements in both plane-wave and finite-source excitation schemes were demonstrated. The result showed that a visible DC offset value was exhibited even after five periods of the incident wave.
Open Access
Applications of hybrid discrete Fourier transform moment method to the fast analysis of large rectangular dipole arrays printed on a thin grounded dielectric substrate
(Wiley, 2002) Chou, H.-T.; Ho, H.-K.; Civi, O. A.; Erturk, V. B.
Recently a discrete Fourier transform-method of moments (DFT-MoM) scheme was developed for fast analysis of electrically large rectangular planar dipole arrays, which has been shown to be very efficient in terms of number reduction of unknown variables and computational complexity. The applications of this DFT-MoM to treat dipole arrays printed on a grounded dielectric substrate are examined in this Letter. Numerical results are presented to validate its efficiency and accuracy.
Open Access
Comparison of surface-modeling techniques
(IEEE, 1997-07) Sertel, Kubilay; Gürel, Levent
Solution techniques based on surface integral equations are widely used in computational electromagnetics. The accurate surface models increase the accuracy solutions by using exact and flat-triangulation models for a sphere. For a required solution accuracy, the problem size is significantly reduced by using geometry models for the scatterers. The dependence of the accuracy of the solution on the geometry modeling is investigated.
Open Access
Comparisons of FMM implementations employing different formulations and iterative solvers
(IEEE, 2003-06) Gürel, Levent; Ergül, Özgür
The implementation of multi-level fast multipole algorithm (MLFMA) requires the consideration of several parameters. The preferred combination of the parameters given is not trivially obvious and requires a careful investigation. This paper extensively investigates such parameters by using a series of scattering problems of various sizes containing different numbers of unknowns as a testbed.
Open Access
Computational analysis of complicated metamaterial structures using MLFMA and nested preconditioners
(IEEE, 2007-11) Ergül, Özgür; Malas, Tahir; Yavuz, Ç; Ünal, Alper; Gürel, Levent
We consider accurate solution of scattering problems involving complicated metamaterial (MM) structures consisting of thin wires and split-ring resonators. The scattering problems are formulated by the electric-field integral equation (EFIE) discretized with the Rao-Wilton- Glisson basis functions defined on planar triangles. The resulting dense matrix equations are solved iteratively, where the matrix-vector multiplications that are required by the iterative solvers are accelerated with the multilevel fast multipole algorithm (MLFMA). Since EFIE usually produces matrix equations that are ill-conditioned and difficult to solve iteratively, we employ nested preconditioners to achieve rapid convergence of the iterative solutions. To further accelerate the simulations, we parallelize our algorithm and perform the solutions on a cluster of personal computers. This way, we are able to solve problems of MMs involving thousands of unit cells.
Open Access
E-polarized beam scattering by an open cylindrical PEC strip having an arbitrary "conical-section" profile
(John Wiley & Sons, Inc., 2001) Oğuzer, T.; Nosich, A. I.; Altintaş, A.
Two-dimensional (2-D) scattering of waves by a conducting strip with a canonical profile is simulated in the E-polarization case. This analysis is performed by reducing a singular integral equation (IE) to the dual-series equations, and making their analytical regularization. Furthermore, the incident field is taken as a complex source point (CSP) beam. This is an extension of our previous studies about circular and parabolic reflector antennas. The algorithm features are demonstrated. Far-field characteristics are presented for quite large-size curves strips of elliptic, parabolic, and hyperbolic profiles.
Open Access
Effective preconditioners for large integral-equation problems
(IET, 2007-11) Malas, Tahir; Ergül, Özgür; Gürel, Levent
We consider effective preconditioning schemes for the iterative solution of integral-equation methods. For parallel implementations, the sparse approximate inverse or the iterative solution of the near-field system enables fast convergence up to certain problem sizes. However, for very large problems, the near-field matrix itself becomes too crude approximation to the dense system matrix and preconditioners generated from the near-field interactions cannot be effective. Therefore, we propose an approximation strategy to the multilevel fast multipole algorithm (MLFMA) to be used as a preconditioner. Our numerical experiments reveal that this scheme significantly outperforms other preconditioners. With the combined effort of effective preconditioners and an efficiently parallelized MLFMA, we are able to solve targets with tens of millions of unknowns in a few hours.
Open Access
Efficient analysis of large phased arrays using iterative MoM with DFT-based acceleration algorithm
(John Wiley & Sons, Inc., 2003) Ertürk, V. B.; Chou, H-T.
A discrete Fourier transform (DFT)-based iterative method of moments (IMoM) algorithm is developed to provide an O(Ntot) computational complexity and memory storages for the efficient analysis of electromagnetic radiation/scattering from large phased arrays. Here, Ntot is the total number of unknowns. Numerical results for both printed and free-standing dipole arrays are presented to validate the algorithm's efficiency and accuracy.
Open Access
Extension of forward backward method with DFT based acceleration algorithm for the efficient analysis of large periodic arrays with arbitrary boundaries
(IEEE, 2003) Çivi, Ö. A.; Chou, H. T.; Ertürk, Vakur B.
An extension of Forward-Backward (FB) with Discrete Fourier Transform (DFT) based acceleration approach is presented. This is given to provide a relatively efficient analysis of EM radiation/scattering from an electrically large, planar, periodic, finite arrays with arbitrary boundaries, such as arrays with circular or elliptical boundaries. It is shown that only very few significant DFT terms are sufficient to provide accurate results.
Open Access
Fast acceleration algorithm based on DFT expansion for the iterative MoM analysis of electromagnetic radiation/scattering from two-dimensional large phased arrays
(IEEE, 2002) Ertürk, Vakur B.; Chou, H. T.
An acceleration algorithm based on Discrete Fourier Transform (DFT) is developed to reduce the computational complexity and memory storages of iterative methods of moment (IMoM) solution to O(Ntot), where Ntot is the total number of elements in the array. As such, numerical results for free-standing dipoles obtained using IMoM-DFT approach are presented and compared with the conventional MoM solution.
Open Access
Fast algorithm for scattering from planar arrays of conducting patches
(Institute of Electrical and Electronics Engineers, 1998-04) Gürel, Levent; Chew, W. C.
A direct (noniterative) algorithm for the solution of the electromagnetic scattering from three-dimensional planar arrays of conducting patches is developed. For an N-unknown problem, the computational complexity of this new solution technique is shown to be O(N2 log2N), which is considerably lower than the O(N3) computational complexity of the conventional direct solution techniques. The advantages of the reduction in the computational complexity is pronounced in the solution of large electromagnetics problems, such as scattering from large and finite arrays of patches, synthesis and analysis of finite-sized frequency selective surfaces (FSS's), and radiation and scattering from large phased-array antennas, to name a few.
Open Access
Fast and accurate solutions of scattering problems involving dielectric objects with moderate and low contrasts
(IEEE, 2007-08) Ergül, Özgür; Gürel, Levent
We consider the solution of electromagnetic scattering problems involving relatively large dielectric objects with moderate and low contrasts. Three-dimensional objects are discretized with Rao-Wilton-Glisson functions and the scattering problems are formulated with surface integral equations. The resulting dense matrix equations are solved iteratively by employing the multilevel fast multipole algorithm. We compare the accuracy and efficiency of the results obtained by employing various integral equations for the formulation of the problem. If the problem size is large, we show that a combined formulation, namely, electric-magnetic current combined-field integral equation, provides faster iterative convergence compared to other formulations, when it is accelerated with an efficient block preconditioner. For low-contrast problems, we introduce various stabilization procedures in order to avoid the numerical breakdown encountered in the conventional surface formulations. © 2007 IEEE.
Open Access
Fast direct (noniterative) solvers for integral-equation formulations of scattering problems
(IEEE, 1998) Gürel, Levent; Chew, W. C.
A family of direct (noniterative) solvers with reduced computational complexity is proposed for solving problems involving resonant or near-resonant structures. Based on the recursive interaction matrix algorithm, the solvers exploit the aggregation concept of the recursive aggregate T-matrix algorithm to accelerate the solution. Direct algorithms are developed to compute the scattered field and the current coefficient, and invert the impedance matrix. Computational complexities of these algorithms are expressed in terms of the number of harmonics P required to express the scattered field of a larger scatterer made up of N scatterers. The exact P-N relation is determined by the geometry.
Open Access
Fast direct solution algorithm for electromagnetic scattering from 3D planar and quasi-planar geometries
(IEEE, 1997) Gürel, Levent; Chew, W. C.
A non-iterative method and its application to planar geometries in homogeneous media is presented. The method is extendable to the cases of quasi-planar structures and/or layered-media problems. The fast direct algorithm (FDA)/steepest descent path (SDP) takes advantage of the fact that the induced currents on planar and quasi-planar geometries interact with each other within a very limited solid angle. Thus, all the degrees of freedom required to solve a `truly 3D' geometry are not required for a planar or quasi-planar geometry, and this situation can be exploited to develop efficient solution algorithms.
Open Access
Fast multipole method in layered media: 2-D electromagnetic scattering problems
(IEEE, 1996) Gürel, Levent; Aksun, M. İrşadi
In this study, the Fast Multipole Method (FMM) is extended to layered-media problems. As an example, the solution of the scalar Helmholtz equation for the electromagnetic scattering from a two-dimensional planar array of horizontal strips on a layered substrate is demonstrated.
Open Access
Fast noniterative steepest descent path algorithm for planar and quasi-planar patch geometries
(IEEE, 1998) Gürel, Levent; Chew, W. C.
The fast noniterative steepest descent path (SDP) algorithm for planar and quasi-planar patch geometries are discussed. The comparison of scattered fields as computed by the method of moments (MOM) and fast direct algorithm (FDA)/SDP are described. The solution times of FDA/SDP, MOM, and recursive aggregate-T-matrix algorithm (RATMA) are obtained by solving the scattering problems of increasingly larger planar arrays of patches without taking advantage of the periodicities and the symmetries of these arrays.
Open 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.