A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf
.
The closedness subspace method for computing the multiplicity structure of a polynomial system
[unknown]
2009
Contemporary Mathematics
unpublished
The multiplicity structure of a polynomial system at an isolated zero is identified with the dual space consisting of differential functionals vanishing on the entire polynomial ideal. Algorithms have been developed for computing dual spaces as the kernels of Macaulay matrices. These previous algorithms face a formidable obstacle in handling Macaulay matrices whose dimensions grow rapidly when the problem size and the order of the differential functionals increase. This paper presents a new
doi:10.1090/conm/496/09733
fatcat:5kx7lsfkknalxciwiw7vud32pq