Identification of the Domain, Ranges, and Values of Complex Roots of a Polynomial with Complex Coefficients Based on Stable Address Sorting

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.