Sparse resultant perturbations
The authors consider linear infinitesimal perturbations on sparse resultants, thus obtaining a family of projection operators and a general method for handling algebraic systems in the presence of ``excess components or other degenerate inputs. They generalize Canny's generalized characteristic polynomial for the homogeneous case, while it provides a new and faster algorithm for computing Roja's toric perturbation. The main contribution of the paper is this simple perturbation scheme based on a lifting of the polytopes (a subset of the input coefficient need be perturbed and produce sparse projection operators defined by a determinant such that, after specialization, these operators are not identically zero but vanish on roots in the proper components of the variety, including all isolated roots). They illustrate their approach through its Maple implementation applied to specific examples. They also discuss two geometric applications: first they show how their sparse resultant perturbation generalize the known linear perturbation in computational geometry and second how they are directly applicable to the problem of parametric implicitization with base points. For the entire collection see [Zbl 1008.00013].
This page was built for publication: Sparse resultant perturbations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4418123)
