Advertisement

Generalized characteristic polynomials

  • John Canny
Algebraic Geometry
Part of the Lecture Notes in Computer Science book series (LNCS, volume 358)

Abstract

We generalize the notion of characteristic polynomial for a system of linear equations to systems of multivariate polynomial equations. The generalization is natural in the sense that it reduces to the usual definition when all the polynomials are linear. Whereas the constant coefficient of the characteristic polynomial of a linear system is the determinant, the constant coefficient of the general characteristic polynomial is the resultant of the system. This construction is applied is solve a traditional problem with efficient methods for solving systems of polynomial equations: the presence of infinitely many solutions “at infinity”. We give a single-exponential time method for finding all the isolated solution points of a system of polynomials, even in the presence of infinitely many solutions at infinity or elsewhere.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [Can]
    Canny J. F., “A New Algebraic Method for Motion Planning and Real Geometry”, Proc. 28th IEEE Symp. FOCS, Los Angeles, (1987), pp 39–48.Google Scholar
  2. [C88]
    Canny J. F. “Some Algebraic and Geometric Computations in PSPACE”, to appear in Proc. ACM STOC, Chicago (May 1988).Google Scholar
  3. [Csa]
    Csanky L., “Fast Parallel Matrix Inversion Algorithms” SIAM J. Comp., Vol. 5, No. 4, (Dec. 1976) pp 618–623.Google Scholar
  4. [Laz]
    Lazard D., “Résolution des Systèmes d'Équations Algébriques”, Theor. Comp. Sci. vol 15, (1981).Google Scholar
  5. [Mac]
    Macaulay F. S., “Some Formulae in Elimination” Proc. London Math. Soc. (1) 35 (1902) pp. 3–27.Google Scholar
  6. [Mum]
    Mumford D., “Algebraic Geometry I, Complex Projective Varieties”, Springer-Verlag, New York, (1976).Google Scholar
  7. [Ren]
    Renegar J., “On the Worst Case Arithmetic Complexity of Approximating Zeros of Systems of Polynomials”, Tech. Rept. School of Operations Research and Industrial Engineering, Cornell U. (May 1987).Google Scholar
  8. [Wae]
    van der Waerden B. L., “Modern Algebra”, (third edition) F. Ungar Publishing Co., New York (1950).Google Scholar
  9. [Wie]
    Wiedemann D.H. “Solving Sparse Linear Equations over Finite Fields”, IEEE Trans. Infor mation Theory, vol. IT-32, No 1, (Jan. 1986).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1989

Authors and Affiliations

  • John Canny
    • 1
  1. 1.Computer Science DivisionUniversity of CaliforniaBerkeley

Personalised recommendations