The resultant iteration for determining the stability of a polynomial
Abstract: The square root iteration is known to be convergent to from starting values in the open right half-plane, and to from starting values in the open left half-plane. The resultant of the quadratic and a given polynomial , of proper degree n, is a polynomial whose zeros, expressed in terms of the zeros of , are just . The construction of is thus equivalent to n independent applications of the square root iteration, with unknown starting values . Repetition of this construction generates a sequence of resultants whose zeros are independently convergent to either or according as the initial zero of lies in the open right or left half-plane. When the given polynomial, and each of the resultants, is written as a linear combination of the polynomials . the sequence of resultants is ultimately convergent to one of the elements of this basis, whence it follows that has p zeros with positive real part and zeros with negative real part, and the Hurwitz stability problem for is solved. By an application of the principle of argument it is, in general, possible to determine p at a finite stage of the resultant iteration.
When formulated in terms of this basis, the resultant iteration becomes formally identical with the root-squaring process. This fact may be exploited to establish the properties of the resultant iteration, and to show that root-squaring may be applied to solve the Schur stability problem for a given polynomial. Although precise results are not available, numerical results and the general properties of this iteration suggest that, for the purpose at hand, it is unaffected by the progressive deterioration of condition that sometimes occurs in other applications of root-squaring.
-  Erwin H. Bareiss, Resultant procedure and the mechanization of the Graeffe process, J. Assoc. Comput. Mach. 7 (1960), 346–386. MR 0119416, https://doi.org/10.1145/321043.321049
-  E. H. BAREISS, "The numerical solution of polynomial equations and the resultant procedures" in Mathematical Methods for Digital Computers, Vol. II (A. Ralston & H. S. Wilf, Editors), Wiley, New York, 1967, pp. 185-214.
-  William Snow Burnside and Arthur William Panton, The theory of equations: With an introduction to the theory of binary algebraic forms, 2 volumes, Dover Publications, Inc., New York, 1960. MR 0115987
-  A. Cohn, Über die Anzahl der Wurzeln einer algebraischen Gleichung in einem Kreise, Math. Z. 14 (1922), no. 1, 110–148 (German). MR 1544543, https://doi.org/10.1007/BF01215894
-  Eugene D. Denman and Alex N. Beavers Jr., The matrix sign function and computations in systems, Appl. Math. Comput. 2 (1976), no. 1, 63–94. MR 0393075, https://doi.org/10.1016/0096-3003(76)90020-5
-  R. J. Duffin, Algorithms for classical stability problems, SIAM Rev. 11 (1969), 196–213. MR 0249740, https://doi.org/10.1137/1011034
-  H. Kober, Dictionary of conformal representations, Dover Publications, Inc., New York, N. Y., 1952. MR 0049326
-  Cornelius Lanczos, Applied analysis, Prentice Hall, Inc., Englewood Cliffs, N. J., 1956. MR 0084175
-  Morris Marden, Geometry of polynomials, Second edition. Mathematical Surveys, No. 3, American Mathematical Society, Providence, R.I., 1966. MR 0225972
-  D.-E. MAYER, "Sur les équations algébriques," Ann. de Math. (3), v. 10, 1891, pp. 111-124.
-  F. W. J. Olver, The evaluation of zeros of high-degree polynomials, Philos. Trans. Roy. Soc. London. Ser. A. 244 (1952), 385–415. MR 0049652, https://doi.org/10.1098/rsta.1952.0010
-  Jean Peltier, Résolution numérique des équations algébriques, Gauthier-Villars, Paris, 1957 (French). MR 0088797
-  James B. Scarborough, Numerical mathematical analysis, Sixth edition, The Johns Hopkins Press, Baltimore, Md., 1966. MR 0198651
-  B. L. VAN DER WAERDEN, Modern Algebra, Vol. I, Ungar, New York, 1949.
-  J. H. Wilkinson, Rounding errors in algebraic processes, Prentice-Hall, Inc., Englewood Cliffs, N.J., 1963. MR 0161456
- E. H. BAREISS, Resultant procedure and the mechanization of the Graeffe process," J. Assoc. Comput. Mach., v. 7, 1960, pp. 346-386. MR 0119416 (22:10178)
- E. H. BAREISS, "The numerical solution of polynomial equations and the resultant procedures" in Mathematical Methods for Digital Computers, Vol. II (A. Ralston & H. S. Wilf, Editors), Wiley, New York, 1967, pp. 185-214.
- W. S. BURNSIDE & A. W. PANTON, The Theory of Equations, Two volumes, Dover, New York, 1960. MR 0115987 (22:6784)
- A. COHN, "Über die Anzahl der Wurzeln einer algebraischen Gleichung in einem Kreise," Math. Z., v. 14, 1922, pp. 110-148. MR 1544543
- E. D. DENMAN & A. N. BEAVERS, JR., "The matrix sign function and computation in systems," Appl. Math. Comput., v. 2, 1976, pp. 63-94. MR 0393075 (52:13886)
- R. J. DUFFIN, "Algorithms for classical stability problems," SIAM Rev., v. 11, 1969, pp. 196-213. MR 0249740 (40:2981)
- H. KOBER, Dictionary of Conformal Representations, Dover, New York, 1952. MR 0049326 (14:156d)
- C. LANCZOS, Applied Analysis, Prentice-Hall, Englewood Cliffs, N. J., 1956. MR 0084175 (18:823c)
- M. MARDEN, Geometry of Polynomials, Math. Surveys, no. 3, Amer. Math. Soc., Providence, R. I., 1966. MR 0225972 (37:1562)
- D.-E. MAYER, "Sur les équations algébriques," Ann. de Math. (3), v. 10, 1891, pp. 111-124.
- F. W. J. OLVER, "The evaluation of zeros of high-degree polynomials," Philos. Trans. Roy. Soc. London Ser. A, v. 244, 1952, pp. 385-415. MR 0049652 (14:209f)
- J. PELTIER, Résolution Numérique des Équations Algébriques, Gauthier-Villars, Paris, 1957. MR 0088797 (19:582a)
- J. B. SCARBOROUGH, Numerical Mathematical Analysis, 6th ed., The Johns Hopkins Press, Baltimore, Maryland, 1966. MR 0198651 (33:6806)
- B. L. VAN DER WAERDEN, Modern Algebra, Vol. I, Ungar, New York, 1949.
- J. H. WILKINSON, Rounding Errors in Algebraic Processes, Prentice-Hall, Englewood Cliffs, N. J., 1963. MR 0161456 (28:4661)
Retrieve articles in Mathematics of Computation with MSC: 65E05
Retrieve articles in all journals with MSC: 65E05