Search
Search results for: ROOT FINDING ALGORITHM, PROPAGATION, WAVEGUIDES
-
Efficient Complex Root Finding Algorithm for Microwave and Optical Propagation Problems
PublicationArticle relates to the use of innovative root finding algorithm (on a complex plane) to study propagation properties of microwave and optical waveguides. Problems of this type occur not only in the analysis of lossy structures, but also in the study of complex and leaky modes (radiation phenomena). The proposed algorithm is simple to implement and can be applied for functions with singularities and branch cuts in the complex plane...
-
Evaluation of propagation parameters of open guiding structures with the use of complex root finding algorithms
PublicationAn efficient complex root tracing algorithm is utilized for the investigation of electromagnetic wave propagation in open guiding structures. The dispersion characteristics of propagated and leaky waves are calculated for a couple of chosen waveguides. The efficiency of the root tracing algorithm is discuses and compared to a global root finding algorithm.
-
Efficient Complex Root Tracing Algorithm for Propagation and Radiation Problems
PublicationAn efficient complex root tracing algorithm for propagation and radiation problems is presented. The proposed approach is based on a discretization of Cauchy’s Argument Principle and its generalization to the C × R space. Moreover, an engagement of the tracing process with a global root finding algorithm recently presented in the literature is performed. In order to confirm a validity and efficiency of the proposed technique, a...
-
Propagation in the Open Cylindrical Guide of Arbitrary Cross Section With the Use of Field Matching Method
PublicationA simple solution to propagation problem in open waveguides and dielectric fibers of arbitrary convex cross section is presented. The idea of the analysis is based on the direct field matching technique involving the usage of the field projection at the boundary on a fixed set of orthogonal basis functions. A complex root tracing algorithm is utilized to find the propagation coefficients of the investigated guides. Different convex...
-
Hybrid Method Analysis of Unshielded Guiding Structures
PublicationA combination of mode matching, finite element methods and generalized impedance matrix is presented in a context of propagation problems for open guiding structures. The computational domain is divided into two regions: the first one is a circular cylinder containing whole guiding structure and the second one surrounds this artificial cylinder. The impedance matrix is calculated with the use of finite element method in the first...
-
Multimodal Genetic Algorithm with Phase Analysis to Solve Complex Equations of Electromagnetic Analysis
PublicationIn this contribution, a new genetic-algorithm-based method of finding roots and poles of a complex function of a complex variable is presented. The algorithm employs the phase analysis of the function to explore the complex plane with the use of the genetic algorithm. Hence, the candidate regions of root and pole occurrences are selected and verified with the use of discrete Cauchy's argument principle. The algorithm is evaluated...
-
Scattering and Propagation Analysis for the Multilayered Structures Based on Field Matching Technique
PublicationA semi-analytical method is employed to the analysis of scattering and guiding problems in multilayer dielectric structures. The approach allows to investigate objects with arbitrary convex cross section and is based on the direct field matching technique involving the usage of the field projection at the boundary on a fixed set of orthogonal basis functions. For the scattering problems the scattered field in the far zone is calculated...
-
Complex Root Finding Algorithm Based on Delaunay Triangulation
PublicationA simple and flexible algorithm for finding zeros of a complex function is presented. An arbitrary-shaped search region can be considered and a very wide class of functions can be analyzed, including those containing singular points or even branch cuts. The proposed technique is based on sampling the function at nodes of a regular or a self-adaptive mesh and on the analysis of the function sign changes. As a result, a set of candidate points...
-
An Improvement of Global Complex Roots and Poles Finding Algorithm for Propagation and Radiation Problems
PublicationAn improvement of the recently developed global roots finding algorithm has been proposed. The modification allows to shorten the computational time by reducing the number of function calls. Moreover, both versions of the algorithms (standard and modified) have been tested for numerically defined functions obtained from spectral domain approach and field matching method. The tests have been performed for three simple microwave...
-
A Self-Adaptive Complex Root Tracing Algorithm for the Analysis of Propagation and Radiation Problem
PublicationAn improved complex root tracing algorithm for radiation and propagation issues is proposed. The approach is based on a self-adaptive discretization of Cauchy’s argument principle for a C × R space and requires a reduced number of function calls in comparison to other procedures presented in the literature. A few different examples concerning propagation and radiation problems have been considered to verify the validity and efficiency...
-
Propagation in rectangular waveguides with a pseudochiral Ω slab
PublicationThe transfer matrix approach is applied for analysis of waveguides loaded with a uniaxial pseudochiral Ω slab. In particular a pseudochiral parallel plate and rectangular guides are investigated. Based on the numerical analysis the influence of the pseudochirality on propagation characteristics and field distribution are examined. Other feature such as a field displacement phenomenon appearing in the both considered structures...
-
On root finding algorithms for complex functions with branch cuts
PublicationA simple and versatile method is presented, which enhances the complex root finding process by eliminating branch cuts and branch points in the analyzed domain. For any complex function defined by a finite number of Riemann sheets, a pointwise product of all the surfaces can be obtained. Such single-valued function is free of discontinuity caused by branch cuts and branch points. The roots of the new function are the same as the...
-
Global Complex Roots and Poles Finding Algorithm Based on Phase Analysis for Propagation and Radiation Problems
PublicationA flexible and effective algorithm for complex roots and poles finding is presented. A wide class of analytic functions can be analyzed, and any arbitrarily shaped search region can be considered. The method is very simple and intuitive. It is based on sampling a function at the nodes of a regular mesh, and on the analysis of the function phase. As a result, a set of candidate regions is created and then the roots/poles are verified...
-
Self-Adaptive Mesh Generator for Global Complex Roots and Poles Finding Algorithm
PublicationIn any global method of searching for roots and poles, increasing the number of samples increases the chances of finding them precisely in a given area. However, the global complex roots and poles finding algorithm (GRPF) (as one of the few) has direct control over the accuracy of the results. In addition, this algorithm has a simple condition for finding all roots and poles in a given area: it only requires a sufficiently dense...
-
An O ( n log n ) algorithm for finding edge span of cacti
PublicationLet G=(V,E) be a nonempty graph and xi be a function. In the paper we study the computational complexity of the problem of finding vertex colorings c of G such that: (1) |c(u)-c(v)|>=xi(uv) for each edge uv of E; (2) the edge span of c, i.e. max{|c(u)-c(v)|: uv belongs to E}, is minimal. We show that the problem is NP-hard for subcubic outerplanar graphs of a very simple structure (similar to cycles) and polynomially solvable for...
-
Propagation in Rectangular Waveguides Periodically Loaded with Cylindrical Posts.
PublicationAnaliza rozchodzenie się fali elektromagnetycznej w falowodach prostokątnych z okresowo rozmieszczonymi cylindrycznymi obiektami. Wynikiem analizy są stałych rozprzestrzeniania rodzajów Floquet, które uzyskuje się z rozwiązania równania własnego. W artykule przeprowadzone zostało badanie teoretyczne i eksperymentalne struktur prawie-okresowych i ich macierzy rozproszenia. Pokazano również istnienie pasm przewodzących i zaporowych,...
-
Polarized light pulses propagation and coupling in optical waveguides
PublicationGłównym celem tej pracy było zbudowanie modelu teoretycznego, na bazie równań Maxwella, który pozwoliłby na opis transmisji wielomodowej w falowodach dielektrycznych (światłowodach) z uwzględnieniem efektu nieliniowego typu Kerra. W pracy wyniki teoretyczne zostały porównane z wynikami doświadczalnymi. Do symulacji propagacji światła z uwzględnieniem efektu Kerra niezbędne było rozwiązanie sprzężonych nieliniowych równań Schrödingera...
-
An efficient algorithm for finding ideal schedules
PublicationPodejmujemy problem szeregowania zadań jednostkowych z zadanymi czasamy przybycia i zależnościami kolejnościowymi. Uszeregowanie jest idealne jeśli jednocześnie minimalizuje maksymalny oraz średni czas zakończenia zadania. Podajemy przyklad pokazujący, że uszeregowania idealne nie istnieją dla relacji zależności zadań będącej drzewem, gdy dopuścimy możliwość wystąpienia przerwań. Z drugiej strony podajemy algorytm o złożoności...
-
A polynomial algorithm for finding T-span of generalized cacti
Publication -
A polynomial algorithm for finding T-span of generalized cacti.
PublicationW pracy opisano wielomianowy algorytm wyznaczający optymalne T-pokolorowania dla uogólnionych kaktusów.
-
A self-stabilizing algorithm for finding a spanning tree in a polynomial number of moves
PublicationW pracy rozważa się rozproszony model obliczeń, w którym struktura systemu jest reprezentowana przez graf bezpośrednich połączeń komunikacyjnych. W tym modelu podajemy nowy samostabilizujący algorytm znajdowania drzewa spinającego. Zgodnie z naszą wiedzą jest to pierwszy algorytm dla tego problemu z gwarantowaną wielomianową liczbą ruchów.
-
Global Complex Roots and Poles Finding Algorithm in C × R Domain
PublicationAn algorithm to find the roots and poles of a complex function depending on two arguments (one complex and one real) is proposed. Such problems are common in many fields of science for instance in electromagnetism, acoustics, stability analyses, spectroscopy, optics, and elementary particle physics. The proposed technique belongs to the class of global algorithms, gives a full picture of solutions in a fixed region ⊂ C × R and...
-
Multi-objective electric distribution network reconfiguration solution using runner-root algorithm
Publication -
Damage imaging algorithm for non-destructive inspection of CFRP/steel adhesive joints based on ultrasonic guided wave propagation
PublicationThe paper concerns assessing the quality of the adhesive connection between a steel plate and the reinforcing CFRP laminate. A three-stage algorithm for non-destructive damage imaging was developed. As the first step, an initial study involving dispersion curves of joint components was executed to determine the material parameters and the appropriate excitation frequency. During the second step, damage identification in three-layer...
-
Ryszard Katulski prof. dr hab. inż.
People -
Multipath Complex Root Tracing
PublicationThe problem of multipath root tracing is being addressed in this communication. The self-adaptive complex root tracing algorithm, which was previously utilized for the investigation of various propagation and radiation problems, is analyzed here for the cases when the traced characteristic bifurcates. A procedure of multiroute detection is proposed and demonstrated on the coaxially loaded cylindrical waveguide example.
-
Multimodal Particle Swarm Optimization with Phase Analysis to Solve Complex Equations of Electromagnetic Analysis
PublicationIn this paper, a new meta-heuristic method of finding roots and poles of a complex function of a complex variable is presented. The algorithm combines an efficient space exploration provided by the particle swarm optimization (PSO) and the classification of root and pole occurrences based on the phase analysis of the complex function. The method initially generates two uniformly distributed populations of particles on the complex...
-
A New Approach to Stability Evaluation of Digital Filters
PublicationIn this paper, a new numerical method of evaluating digital filter stability is presented. This approach is based on novel root-finding algorithms at the complex plane using the Delaunay triangulation and Cauchy's Argument Principle. The presented algorithm locates unstable zeros of the characteristic equation with their multiplicities. The proposed method is generic and can be applied to a vast range of systems. Verification of...
-
Data obtained by computation for X-ray focusing using oriented Gaussian beams
Open Research DataThe propagation of X-ray waves through an optical system consisting of several X-ray refractive lenses is considered. Gaussian beams are exact solutions of the paraxial equation. The Helmholtz equation describes the propagation of a monochromatic electromagnetic wave. Since the widths of the beams are much larger than the wavelength of X-rays, Gaussian...
-
Numerical Test for Stability Evaluation of Discrete-Time Systems
PublicationIn this paper, a new numerical test for stability evaluation of discrete-time systems is presented. It is based on modern root-finding techniques at the complex plane employing the Delaunay triangulation and Cauchy's Argument Principle. The method evaluates if a system is stable and returns possible values and multiplicities of unstable zeros of the characteristic equation. For state-space discrete-time models, the developed test...
-
Data obtained by computation for X-ray imaging of grating without magnification using oriented Gaussian beams
Open Research DataThe propagation of X-ray waves through an optical system consisting of grating and X-ray refractive lenses is considered. In this approach, the propagating wave is represented as a superposition of the oriented Gaussian beams. The direction of wave propagation in each Gaussian beam is consistent with the local propagation direction of the X-ray wavefront.
-
Data obtained by computation for X-ray imaging of grating with magnification factor equal 2 using oriented Gaussian beams
Open Research DataThe propagation of X-ray waves through an optical system consisting of grating and X-ray refractive lenses is considered. In this approach, the propagating wave is represented as a superposition of the oriented Gaussian beams. The direction of wave propagation in each Gaussian beam is consistent with the local propagation direction of the X-ray wavefront.
-
Data obtained by computation for X-ray imaging of grating with magnification factor equal 4 using oriented Gaussian beams
Open Research DataThe propagation of X-ray waves through an optical system consisting of grating and X-ray refractive lenses is considered. In this approach, the propagating wave is represented as a superposition of the oriented Gaussian beams. The direction of wave propagation in each Gaussian beam is consistent with the local propagation direction of the X-ray wavefront.
-
Data obtained by computation for X-ray imaging of grating with magnification factor equal 8 using oriented Gaussian beams
Open Research DataThe propagation of X-ray waves through an optical system consisting of grating and X-ray refractive lenses is considered. In this approach, the propagating wave is represented as a superposition of the oriented Gaussian beams. The direction of wave propagation in each Gaussian beam is consistent with the local propagation direction of the X-ray wavefront.
-
Data obtained by numerical simulation for X-ray focusing using a finite difference method
Open Research DataThe propagation of X-ray waves through an optical system consisting of many X-ray refractive lenses is considered. For solving the problem for an electromagnetic wave, a finite-difference method is applied.
-
Analysis of graphene multi-strip planar guiding structures with the use of spectral domain approach
PublicationSpectral domain approach is modified and used to analyze some simple structures containing graphene strips. The modification is simple and concerns the Green’s function only. Moreover, the method is combined with the recently published root finding algorithms, which significantly improve the efficiency of the analysis. The results obtained for a simple guiding structure is verified and the field displacement effect is confirmed.
-
Simulation of Wave Propagation in Media Described by Fractional-Order Models
PublicationIn this paper, algorithms for simulation of the wave propagation in electromagnetic media described by fractional-order (FO) models (FOMs) are presented. Initially, fractional calculus and FO Maxwell's equations are introduced. The problem of the wave propagation is formulated for media described by FOMs. Then, algorithms for simulation of the non-monochromatic wave propagation are presented which employ computations in the time...
-
Square root RC Nyquist filter of fractional delay
PublicationIn this paper we propose a discrete-time FIR (finite impulse response) filter which couples the role of square root Nyquist filter with fractional delay filter. This filter enables to substitute for a cascade of square root RC (SRRC) Nyquist filter and fractional delay filter in one device/algorithm. The aim is to compensate for transmission delay in communication system. Statistically defined performances, e.g. BER (bit error...
-
Efficient uncertainty quantification using sequential sampling-based neural networks
PublicationUncertainty quantification (UQ) of an engineered system involves the identification of uncertainties, modeling of the uncertainties, and the forward propagation of the uncertainties through a system analysis model. In this work, a novel surrogate-based forward propagation algorithm for UQ is proposed. The proposed algorithm is a new and unique extension of the recent efficient global optimization using neural network (NN)-based...
-
Generating optimal paths in dynamic environments using RiverFormation Dynamics algorithm
PublicationThe paper presents a comparison of four optimisation algorithms implemented for the purpose of finding the shortest path in static and dynamic environments with obstacles. Two classical graph algorithms –the Dijkstra complete algorithm and A* heuristic algorithm – were compared with metaheuristic River Formation Dynamics swarm algorithm and its newly introduced modified version. Moreover, another swarm algorithm has been compared...
-
Task Assignments in Logistics by Adaptive Multi-Criterion Evolutionary Algorithm with Elitist Selection
PublicationAn evolutionary algorithm with elitist selection has been developed for finding Pareto-optimal task assignments in logistics. A multi-criterion optimization problem has been formulated for finding a set of Pareto- optimal solutions. Three criteria have been applied for evaluation of task assignment: the workload of a bottleneck machine, the cost of machines, and the numerical performance of system. The machine constraints have...
-
Nowy wewnątrzbudynkowy algorytm wyznaczania położenia obiektów
PublicationW referacie zaprezentowano nowy wewnątrzbudynkowy algorytm wyznaczania położenia obiektów WAP. W algorytmie tym uwzględnia się właściwości środowiska propagacyjnego, dzięki czemu dokładność estymat położenia obiektów wyznaczonych algorytmem WAP jest większa niż wyznaczonych znanymi algorytmami Chana oraz Foy’a. W referacie przedstawiono wyniki analizy porównawczej tych trzech algorytmów z użyciem rzeczywistych pomiarów odległości...
-
New Indoor Positioning Algorithm for Distance Measurements
PublicationIn the paper a new indoor positioning algorithm is presented. This algorithm takes into account selected features of radio wave propagation in indoor environment. This results in improvement in accuracy of calculated position estimates. A comparative analysis of this new algorithm with Chan and Foy algorithms was made and described in the paper. This comparative analysis was made with utilization of real radio distance measurements.
-
Determination of stepped plate thickness distribution using guided waves and compressed sensing approach
PublicationGuided waves recently have attracted significant interest as a very promising research area. The signals registered by a specially designed sensor network are processed to assess the state of the tested structure. Despite the constant development of novel damage detection algorithms employing guided waves, the phenomenon of wave propagation still needs detailed recognizing and understanding for the further progress of non-destructive...
-
Solution of the dike-break problem using finite volume method and splitting technique
PublicationIn the paper the finite volume method (FVM) is presented for the solution of two-dimensional shallow water equations. These equations are frequently used to simulate the dam-break and dike-break induced flows. The applied numerical algorithm of FVM is based on the wave-propagation algorithm which ensures a stable solution and simultaneously minimizes the numerical errors. The dimensional decomposition according to the coordinate...
-
FPGA realization of an improved alpha max plus beta min algorithm
PublicationThe generalized improved version of the alpha max plus beta min square-rooting algorithm and its realization in the Field Programmable Gate Array (FPGA) are presented. The algorithm computes the square root to calculate the approximate magnitude of a complex sample. It is especially useful for pipelined calculations in the DSP. In case of four approximation regions it is possible to reduce the peak error form 3.95% to 0.33%. This...
-
Polynomial Algorithm for Minimal (1,2)-Dominating Set in Networks
PublicationDominating sets find application in a variety of networks. A subset of nodes D is a (1,2)-dominating set in a graph G=(V,E) if every node not in D is adjacent to a node in D and is also at most a distance of 2 to another node from D. In networks, (1,2)-dominating sets have a higher fault tolerance and provide a higher reliability of services in case of failure. However, finding such the smallest set is NP-hard. In this paper, we...
-
RECSYS CHALLENGE 2015: a BUY EVENT PREDICTION IN THE E-COMMERCE DOMAIN
PublicationIn this paper we present our approach to RecSys Challenge 2015. Given a set of e-commerce events, the task is to predict whether a user will buy something in the current session and, if yes, which of the item will be bought. We show that the data preparation and enrichment are very important in finding the solution for the challenge and that simple ideas and intuitions could lead to satisfactory results. We also show that simple...
-
Genetic Programming for Workload Balancing in the Comcute Grid System
PublicationA genetic programming paradigm is implemented for reliability optimization in the Comcute grid system design. Chromosomes are generated as the program functions and then genetic operators are applied for finding Pareto-suboptimal task assignment and scheduling. Results are compared with outcomes obtained by an adaptive evolutionary algorithm.
-
Square Root Raised Cosine Fractionally Delaying Nyquist Filter - Design and Performance Evaluation
PublicationIn this paper we propose a discrete-time FIR (Finite Impulse Response) filter which is applied as a square root Nyquist filter and fractional delay filter simultaneously. The filter enables to substitute for a cascade of square root Nyquist filter and fractional delay filter in one device/algorithm. The aim is to compensate for transmission delay in digital communication system. Performance of the filter as a matched filter is...