Abstract
In this paper, we present a method of programmatic identification of complex roots of polynomials with complex coefficients without specifying the domain of localization of their roots. The method is based on the algorithm of stable address sorting with minimal amount of calculations. Numerical ranges of the real and imaginary parts of the roots are programmatically determined, the roots are identified without loss of significant figures of the mantissa in the format of presentation of numerical data.
Similar content being viewed by others
References
A. T. Bagmanov and A. L. Sanin, “Structures of wave packets in a quantum well,” Usp. Sovrem. Radioelectron., No. 12, 25–34 (2005).
N. S. Bakhvalov, Numerical Methods [in Russian], Nauka, Moscow (1973).
J. S. Bendat and A. G. Piersol, Random Data. Analysis and Measurenemt Procedures, Wiley, New York etc. (1986).
I. S. Berezin and N. G. Zhidkov, Computing Methods [in Russian], Fizmatgiz, Moscow (1962).
V. A. Besekersky and E. P. Popov, Theory of Automatic Control Systems [in Russian], Nauka, Moscow (1987).
B. P. Demidovich, Lectures on the Mathematical Theory of Stability [in Russian], Lan’, Saint Petersburg (2008).
B. P. Demidovich, Mathematical Foundations of Quantum Mechanics [in Russian], Lan’, Saint Petersburg (2006).
D. K. Faddeev and V. N. Faddeeva, Numerical Methods of Linear Algebra [in Russian], Nauka, Moscow (1963).
G. E. Forsythe, M. A. Malcolm, and C. B. Moler, Computer Methods for Mathematical Computations, Prentice-Hall, Englewood Cliffs, New Jersey (1977).
F. R. Gantmacher, The Theory of Matrices [in Russian], Nauka, Moscow (1988).
M. A. Lavrentiev and B. V. Shabat, Methods of the Theory of Function of a Complex Variable [in Russian], Nauka, Moscow (2002).
A. I. Markushevich, A Breif Course of the Theory of Analytic Functions [in Russian], Nauka, Moscow (2006).
A. A. Pistolkors and O. S. Litvinov, Introduction to the Theory of Adaptive Antennas [in Russian], Nauka, Moscow (1991).
Ya. E. Romm, “Localization and stable calculation of zeros of polynomials based on sorting, I,” Kibernet. Sistem. Anal., No. 1, 165–183 (2007).
Ya. E. Romm, Localization of the domain of all complex roots of a polynomial and calculation based on sorting [in Russian], Taganrog (2017).
Ya. E. Romm, “Method for calculation of zeros and extremums of functions based on sorting and applications to search and recognition, I,” Kibernet. Sistem. Anal., No. 4, 142–159 (2001).
Ya. E. Romm, “Method for calculation of zeros and extremums of functions based on sorting and applications to search and recognition, II,” Kibernet. Sistem. Anal., No. 5, 81–101 (2001).
Ya. E. Romm, “Parallel sorting by merging in comparison matrices, I,” Kibernet. Sistem. Anal., No. 5, 3–23 (1994).
Ya. E. Romm, “Parallel sorting by merging in comparison matrices, II,” Kibernet. Sistem. Anal., No. 4, 13–37 (1995).
Ya. E. Romm and I. V. Zaika, “Numerical optimization based on sorting algorithms and applications to differential and general nonlinear equations,” Kibernet. Sistem. Anal., No. 2, 165–180 (2011).
V. V. Voevodin, Numerical Methods of Linear Algebra [in Russian], Nauka, Moscow (1977).
J. H. Wilkinson, The Algebraic Eigenvalue Problem, At the Clarendon Press, Oxford (1965).
Author information
Authors and Affiliations
Corresponding author
Additional information
Translated from Itogi Nauki i Tekhniki, Seriya Sovremennaya Matematika i Ee Prilozheniya. Tematicheskie Obzory, Vol. 166, Proceedings of the IV International Scientific Conference “Actual Problems of Applied Mathematics,” Kabardino-Balkar Republic, Nalchik, Elbrus Region, May 22–26, 2018. Part II, 2019.
Rights and permissions
About this article
Cite this article
Romm, Y.E. Identification of the Domain, Ranges, and Values of Complex Roots of a Polynomial with Complex Coefficients Based on Stable Address Sorting. J Math Sci 260, 219–229 (2022). https://doi.org/10.1007/s10958-022-05686-2
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10958-022-05686-2
Keywords and phrases
- localization of complex roots of a polynomial
- domain of roots of a polynomial
- calculations without losing significant figures
- stable address sorting