Search
Abstract
In 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 initial grid. However, in practice, this requirement may turn out to be very difficult to implement. For a complex and sophisticated function, the use of a regular high-density mesh may be ineffective or even impossible due to limited computational resources. In this article, a method for creating a self-adaptive initial mesh for this algorithm is presented. The proposed solution uses gradient calculation to identify areas that require mesh refinement, including areas where a zero and a pole are in close proximity. The adaptive mesh allows for faster and more accurate analysis of functions with a much smaller number of samples. As shown in the numerical examples, this approach reduces the number of function calls by several orders of magnitude, and thus significantly reduces the computational time.
Citations
-
4
CrossRef
-
0
Web of Science
-
7
Scopus
Authors (4)
Cite as
Full text
full text is not available in portal
Keywords
Details
- Category:
- Articles
- Type:
- artykuły w czasopismach
- Published in:
-
IEEE TRANSACTIONS ON MICROWAVE THEORY AND TECHNIQUES
no. 71,
pages 2854 - 2863,
ISSN: 0018-9480 - Language:
- English
- Publication year:
- 2023
- Bibliographic description:
- Dziedziewicz S., Warecka M., Lech R., Kowalczyk P.: Self-Adaptive Mesh Generator for Global Complex Roots and Poles Finding Algorithm// IEEE TRANSACTIONS ON MICROWAVE THEORY AND TECHNIQUES -Vol. 71,iss. 7 (2023), s.2854-2863
- DOI:
- Digital Object Identifier (open in new tab) 10.1109/tmtt.2023.3238014
- Sources of funding:
-
- Free publication
- Verified by:
- Gdańsk University of Technology
seen 106 times