Multivariate polynomial system solving using intersections of eigenspaces

Abstract

The solutions of a polynomial system can be computed using eigenvalues and eigenvectors of certain endomorphisms. There are two different approaches, one by using the (right) eigenvectors of the representation matrices, one by using the (right) eigenvectors of their transposed ones, i.e. their left eigenvectors. For both approaches, we describe the common eigenspaces and give an algorithm for computing the solution of the algebraic system. As a byproduct, we present a new method for computing radicals of zero-dimensional ideals. © 2001 Academic Press.