Search
Abstract
A 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 is created, where the signs of the real and imaginary parts of the function change simultaneously. To verify and refine the results, an iterative algorithm is applied. The validity of the presented technique is supported by the results obtained in numerical tests involving three different types of functions.
Citations
-
4 0
CrossRef
-
0
Web of Science
-
4 2
Scopus
Cite as
Full text
- Publication version
- Accepted or Published Version
- DOI:
- Digital Object Identifier (open in new tab) 10.1145/2699457
- License
- Copyright (2015 ACM)
Keywords
Details
- Category:
- Articles
- Type:
- artykuł w czasopiśmie wyróżnionym w JCR
- Published in:
-
ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE
no. 41,
edition 3,
pages 1 - 13,
ISSN: 0098-3500 - Language:
- English
- Publication year:
- 2015
- Bibliographic description:
- Kowalczyk P.: Complex Root Finding Algorithm Based on Delaunay Triangulation// ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE. -Vol. 41, iss. 3 (2015), s.1-13
- DOI:
- Digital Object Identifier (open in new tab) 10.1145/2699457
- Verified by:
- Gdańsk University of Technology
seen 167 times