SwePub
Sök i SwePub databas

  Utökad sökning

Träfflista för sökning "WFRF:(Jelinek Lukas) srt2:(2019)"

Sökning: WFRF:(Jelinek Lukas) > (2019)

  • Resultat 1-5 av 5
Sortera/gruppera träfflistan
   
NumreringReferensOmslagsbildHitta
1.
  • Capek, Miloslav, et al. (författare)
  • Inversion-Free Evaluation of Nearest Neighbors in Method of Moments
  • 2019
  • Ingår i: IEEE Antennas and Wireless Propagation Letters. - 1536-1225. ; 18:11, s. 2311-2315
  • Tidskriftsartikel (refereegranskat)abstract
    • A recently introduced technique of topology sensitivity in method of moments is extended by the possibility of adding degrees of freedom (reconstruct) into the underlying structure. The algebraic formulation is inversion-free, suitable for parallelization, and scales favorably with the number of unknowns. The reconstruction completes the nearest neighbors procedure for an evaluation of the smallest shape perturbation. The performance of the method is studied with a greedy search over a Hamming graph representing the structure in which initial positions are chosen from a random set. The method is shown to be an effective data mining tool for machine learning-related applications.
  •  
2.
  • Capek, Miloslav, et al. (författare)
  • Inversion-free evaluation of small geometry perturbation in method of moments
  • 2019
  • Ingår i: 2019 IEEE International Symposium on Antennas and Propagation and USNC-URSI Radio Science Meeting, APSURSI 2019 - Proceedings. - 9781728106922 ; , s. 1039-1040
  • Konferensbidrag (refereegranskat)abstract
    • Topology sensitivity is introduced and defined to be utilized within method of moments. It is based on a series of the smallest perturbations of the investigated structure and, thanks to the application of the Woodbury matrix identity, its evaluation is inversion-free, suitable for vectorization and parallelization, and results in a fast and versatile tool for analyzing antenna optimality.
  •  
3.
  • Capek, Miloslav, et al. (författare)
  • Optimal Planar Electric Dipole Antennas Searching for antennas reaching the fundamental bounds on selected metrics.
  • 2019
  • Ingår i: IEEE Antennas & Propagation Magazine. - : Institute of Electrical and Electronics Engineers (IEEE). - 1045-9243 .- 1558-4143. ; 61:4, s. 19-29
  • Tidskriftsartikel (refereegranskat)abstract
    • Considerable time is often spent optimizing antennas to meet specific design metrics. Rarely, however, are the resulting antenna designs compared to rigorous physical bounds on those metrics. Here, we study the performance of optimized planar meander line antennas with respect to such bounds. Results show that these simple structures meet the lower bound on the radiation quality factor (Q-factor) (maximizing single-resonance fractional bandwidth) but are far from reaching the associated physical bounds for efficiency. The relative performance of other canonical antenna designs is comparable in similar ways, and the quantitative results are connected to intuitions from small antenna design, physical bounds, and matching network design.
  •  
4.
  • Capek, Miloslav, et al. (författare)
  • Shape Synthesis Based on Topology Sensitivity
  • 2019
  • Ingår i: IEEE Transactions on Antennas and Propagation. - 0018-926X. ; 67:6, s. 3889-3901
  • Tidskriftsartikel (refereegranskat)abstract
    • A method evaluating the sensitivity of a given parameter to topological changes is proposed within the method of moments paradigm. The basis functions are used as degrees of freedom which, when compared to the classical pixeling technique, provide important advantages, one of them being impedance matrix inversion free evaluation of the sensitivity. The devised procedure utilizes port modes and their superposition which, together with only a single evaluation of all matrix operators, leads to a computationally effective procedure. The proposed method is approximately 100 times faster than the contemporary approaches, which allows the investigation of the sensitivity and the modification of shapes in real time. The method is compared with the known approaches and its validity and effectiveness are verified using a series of examples. The procedure can be implemented in up-to-date electromagnetic (EM) simulators in a straightforward manner. It is shown that the iterative repetition of the topology sensitivity evaluation can be used for gradient-based topology synthesis. This technique can also be employed as a local step in global optimizers.
  •  
5.
  • Gustafsson, Mats, et al. (författare)
  • Upper bounds on absorption and scattering
  • 2019
  • Rapport (övrigt vetenskapligt/konstnärligt)abstract
    • A general framework for determining fundamental bounds in nanophotonics is introduced in this paper. The theory is based on convex optimization of dual problems constructed from operators generated by electromagnetic integral equations. The optimized variable is a contrast current defined within a prescribed region of a given material constitutive relations. Two power conservation constraints analogous to the optical theorem are utilized to tighten the bounds and to prescribe either losses or material properties. Thanks to the utilization of matrix rank-1 updates, modal decompositions, and model order reduction techniques, the optimization procedure is computationally efficient even for complicated scenarios. No dual gaps are observed. The method is well-suited to accommodate material anisotropy and inhomogeneity. To demonstrate the validity of the method, bounds on scattering, absorption, and extinction cross sections are derived first and evaluated for several canonical regions. The tightness of the bounds is verified by comparison to optimized spherical nanoparticles and shells. The next metric investigated is bi-directional scattering studied closely on a particular example of an electrically thin slab. Finally, the bounds are established for Purcell's factor and local field enhancement where a dimer is used as a practical example.
  •  
Skapa referenser, mejla, bekava och länka
  • Resultat 1-5 av 5

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Stäng

Kopiera och spara länken för att återkomma till aktuell vy