Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
10325828 | Journal of Symbolic Computation | 2012 | 11 Pages |
Abstract
We present an explicit algorithm to compute a closed basis of the local dual space of I=(f1,â¦,ft) at a given isolated singular solution xË=(xË1,â¦,xËs) when the Jacobian matrix J(xË) has corank one. The algorithm is efficient both in time and memory use. Moreover, it can be modified to compute an approximate basis if the coefficients of f1,â¦,ft and xË are only known with limited accuracy.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Artificial Intelligence
Authors
Nan Li, Lihong Zhi,