Global Complex Roots and Poles Finding Algorithm Based on Phase Analysis for Propagation and Radiation Problems

06/18/2018
by   Piotr Kowalczyk, et al.
0

A 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 using a discretized Cauchy's argument principle. The accuracy of the results can be improved by the application of a self-adaptive mesh. The effectiveness of the presented technique is supported by numerical tests involving different types of structures, where electromagnetic waves are guided and radiated. The results are verified, and the computational efficiency of the method is examined.

READ FULL TEXT

page 3

page 4

research
06/18/2018

GRPF: Global Complex Roots and Poles Finding Algorithm Based on Phase Analysis

A flexible and effective algorithm GRPF (Global complex Roots and Poles ...
research
05/11/2020

A Mesh-free Method Using Piecewise Deep Neural Network for Elliptic Interface Problems

In this paper, we propose a novel mesh-free numerical method for solving...
research
12/14/2022

Non-conforming multipatches for NURBS-based finite element analysis of higher-order phase-field models for brittle fracture

This paper proposes an effective computational tool for brittle crack pr...
research
10/13/2022

Strong form mesh-free hp-adaptive solution of linear elasticity problem

We present an algorithm for hp-adaptive collocation-based mesh-free nume...
research
01/12/2022

A novel hierarchical multiresolution framework using CutFEM

In this paper, we propose a robust concurrent multiscale method for cont...
research
03/03/2023

Spatially-varying meshless approximation method for enhanced computational efficiency

In this paper, we address a way to reduce the total computational cost o...

Please sign up or login with your details

Forgot password? Click here to reset