Computation of Physical Optics Integral by Levin's Algorithm on NURBS

Date

2010-01-01

Author

Durgun, Ahmet Cemal
Balanis, Constantine A.

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

140
views

0
downloads

Non-Uniform Rational B-Splines (NURBS) are very powerful modeling tools for geometric design due to several reasons including fast and numerically stable algorithms and unified mathematical basis for representing complex objects [1]. Although target modeling is easy with NURBS, applying some numerical tools directly on NURBS is not so straightforward. Since the surface point function and derivative computation is simpler for rational Bezier surfaces (RBS), NURBS surfaces are converted to RBS by Cox-de Boor Algorithm for numerical implementations [2]. Therefore, solving a problem for RBS corresponds to solving it for NURBS surfaces. Indeed, in this paper, RBS are used for surface modeling and radar cross section (RCS) computations. The RCS computations are performed by employing Physical Optics (PO) approximation which is accurate at high frequency regions [3]. Although PO is a more efficient technique for scattering problems at high frequencies, when compared to full-wave techniques, it may be intractable due to rapid oscillations of the PO integral. In the literature, there are several methods to handle the oscillatory integrals including the stationary phase method, which is already applied to PO computations on NURBS surfaces [2, 4]. Another method proposed for highly oscillatory integrals is the Levin's method which was previously applied to PO problems, particularly RCS computation of targets modeled by quadrilaterals [5]. In this paper, the same approach is utilized on RBS.

URI

https://hdl.handle.net/11511/69972

DOI

https://doi.org/10.1109/aps.2010.5561976

Collections

Department of Electrical and Electronics Engineering, Conference / Seminar

Suggestions

OpenMETU
Core

APPROXIMATION OF BOUNDS ON MIXED-LEVEL ORTHOGONAL ARRAYS Sezer, Ali Devin; Özbudak, Ferruh (2011-06-01) Mixed-level orthogonal arrays are basic structures in experimental design. We develop three algorithms that compute Rao- and Gilbert-Varshamov-type bounds for mixed-level orthogonal arrays. The computational complexity of the terms involved in the original combinatorial representations of these bounds can grow fast as the parameters of the arrays increase and this justifies the construction of these algorithms. The first is a recursive algorithm that computes the bounds exactly, the second is based on an as...
Coarse-to-Fine Isometric Shape Correspondence by Tracking Symmetric Flips Sahillioğlu, Yusuf; Yemez, Y. (2013-02-01) We address the symmetric flip problem that is inherent to multi-resolution isometric shape matching algorithms. To this effect, we extend our previous work which handles the dense isometric correspondence problem in the original 3D Euclidean space via coarse-to-fine combinatorial matching. The key idea is based on keeping track of all optimal solutions, which may be more than one due to symmetry especially at coarse levels, throughout denser levels of the shape matching process. We compare the resulting den...
Applications of hybrid discrete Fourier transform-moment method to the fast analysis of large rectangular dipole arrays printed on a thin grounded dielectric substrate Chou, HT; Ko, HK; Aydın Çivi, Hatice Özlem; ERTÜRK, VAKUR BEHÇET (2002-08-05) 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. (C) 2002 Wiley Periodicals, ...
Efficient subquadratic space complexity binary polynomial multipliers based on block recombination Cenk, Murat; Negre, Christophe (2014-09-01) Some applications like cryptography involve a large number of multiplications of binary polynomial. In this paper we consider two, three and four-way methods for parallel implementation of binary polynomial multiplication. We propose optimized three and four-way split formulas which reduce the space and time complexity of the best known methods. Moreover, we present a block recombination method which provides some further reduction in the space complexity of the considered two, three and four-way split mult...
Hierarchical Parallelization of the Multilevel Fast Multipole Algorithm (MLFMA) Gurel, Levent; Ergül, Özgür Salih (2013-02-01) Due to its O(NlogN) 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 unkno...

Citation Formats

A. C. Durgun and C. A. Balanis, “Computation of Physical Optics Integral by Levin’s Algorithm on NURBS,” 2010, Accessed: 00, 2021. [Online]. Available: https://hdl.handle.net/11511/69972.