2 sonuçlar
Arama Sonuçları
Listeleniyor 1 - 2 / 2
Yayın Image recovery of inaccessible rough surfaces profiles having impedance boundary condition(IEEE, 2022) Sefer, Ahmet; Yapar, AliThis letter addresses a reconstruction algorithm of locally rough inaccessible surface profiles via the knowledge of the scattered field data under the consideration of the impedance boundary condition (IBC). To this aim, first, the synthetic scattered field data are obtained through the solution of the conventional surface integral equation (SIE) written on the rough surface. Then, the same SIE together with the data equation is solved iteratively via Newton's method to obtain the image of the rough surface profile. In the numerical implementation, the nonlinear ill-posed inverse problem is linearized in an iterative fashion via the Newton method and regularized by Tikhonov in the least-squares sense. The feasibility of the algorithm is provided via numerical examples, which shows that the method is effective and promising.Yayın FSRFT - Fast simplified real frequency technique via selective target data approach for broadband double matching(IEEE, 2017-02) Köprü, RamazanThis brief introduces a broadband double-matching (DM) solver called fast simplified real frequency technique (FSRFT). FSRFT is essentially a greatly accelerated variant of the well-known classical simplified real frequency technique (SRFT). The basic idea that turns the classical SRFT into a 'fast' SRFT relies on two main approaches: the selective target data approach (STDA) and the constraint optimization approach (COA). STDA constructs an optimization target data set formed of only critically selected target data whose element number is equal to or slightly greater than the order of the system unknowns n plus 1, {n}+1. In order to exhibit speed performance comparison between SRFT and FSRFT, an example design is considered. An exemplary DM problem, dealing with an {n}=6th order low-pass Chebyshev-type equalizer design to match the given generator and load impedances, has been solved by SRFT within 29 s using 90 target data in a typical computer - e.g., Intel 2.20-GHz i7 CPU with 8-GB RAM. On the other hand, the same problem has been solved by the newly proposed FSRFT within only 0.6 s using only n+1=7 critically selected target data in the same computer. FSRFT introduced herein works in any domain, i.e., lumped, distributed, and mixed.
