Related Experiment Video
Updated: Apr 21, 2026

Generation and Coherent Control of Pulsed Quantum Frequency Combs
Published on: June 8, 2018
Numerical evaluation and comparison of Kalantari's zero bounds for complex polynomials
Matthias Dehmer1, Yury Robertovich Tsoy2
1Department of Computer Science, Universität der Bundeswehr München, Neubiberg-München, Germany; UMIT - The Health & Life Sciences University, Department for Biomedical Informatics and Mechatronics, Hall in Tyrol, Austria.
This study examines zero bounds using special polynomials. Numerical and analytical results demonstrate the performance of these bounds in mathematical analysis.
Area of Science:
- Mathematics
- Numerical Analysis
Background:
- Zero bounds are crucial in various mathematical fields.
- Investigating their performance enhances theoretical understanding.
Purpose of the Study:
- To evaluate the performance of zero bounds proposed by Kalantari and Dehmer.
- To explore the application of special polynomial classes in this evaluation.
Main Methods:
- Utilizing specific classes of polynomials for analysis.
- Employing both numerical simulations and analytical derivations.
Main Results:
- Demonstrated performance of Kalantari and Dehmer's zero bounds.
- Validation through consistent numerical and analytical outcomes.
Conclusions:
- The study provides evidence for the effectiveness of the investigated zero bounds.
- Special polynomials offer a viable approach for analyzing zero bound performance.
Related Concept Videos
Complex Zeros
Real Zeros of Polynomials
Routh-Hurwitz Criterion II
The first scenario occurs when a singular zero appears in the first column of the Routh table. This situation creates a division by zero issues. To resolve this, a small positive or negative number, denoted as epsilon (∈), is substituted for the zero. The stability analysis proceeds by assuming a sign for ∈. If ∈ is positive, any sign change in the first...
Fundamental Theorem of Algebra
Indeterminate Products
Quadratic Equations in the Complex Number System
