The Minimum Root Separation of a Polynomial
Authors:
- George E. CollinsGCGeorge E. Collins
- Ellis HorowitzEHEllis Horowitz
- 1 April 1974
- journal article
- Published by JSTOR in Mathematics of Computation
- Vol. 28 (126) , 589-597
Abstract
The minimum root separation of a complex polynomial A is defined as the minimum of the distances between distinct roots of A. For polynomials with Gaussian integer coefficients and no multiple roots, three lower bounds are derived for the root separation. In each case, the bound is a function of the degree n of A and the sum d of the absolute values of the coefficients of A. The notion of a seminorm for a commutative ring is defined, and it is shown how any seminorm can be extended to polynomial rings and matrix rings, obtaining a very general analogue of Hadamard’s determinant theorem.Keywords
This publication has 5 references indexed in Scilit:
- The Exact Solution of Systems of Linear Equations with Polynomial CoefficientsJournal of the ACM, 1973
- Integer Arithmetic Algorithms for Polynomial Real Zero DeterminationJournal of the ACM, 1971
- The Calculation of Multivariate Polynomial ResultantsJournal of the ACM, 1971
- The Art of Computer Programming. Vol. II: Seminumerical AlgorithmsMathematics of Computation, 1970
- Introduction to Linear AlgebraMathematics of Computation, 1966