A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is
AbstractIn 1992, Göran Björck and Ralf Fröberg completely characterized the solution set of cyclic-8. In 2001, Jean-Charles Faugère determined the solution set of cyclic-9, by computer algebra methods and Gröbner basis computation. In this paper, a new theory in matrix analysis of rank-deficient matrices together with algorithms in numerical algebraic geometry enables us to present a symbolic-numerical algorithm to derive exactly the defining polynomials of all prime ideals of positivedoi:10.1112/s146115701000001x fatcat:itim62zq7zed7nculzdlt4zbya