20,172 research outputs found
Multihomogeneous resultant formulae by means of complexes
We provide conditions and algorithmic tools so as to classify and construct
the smallest possible determinantal formulae for multihomogeneous resultants
arising from Weyman complexes associated to line bundles in products of
projective spaces. We also examine the smallest Sylvester-type matrices,
generically of full rank, which yield a multiple of the resultant. We
characterize the systems that admit a purely B\'ezout-type matrix and show a
bijection of such matrices with the permutations of the variable groups. We
conclude with examples showing the hybrid matrices that may be encountered, and
illustrations of our Maple implementation. Our approach makes heavy use of the
combinatorics of multihomogeneous systems, inspired by and generalizing results
by Sturmfels-Zelevinsky, and Weyman-Zelevinsky.Comment: 30 pages. To appear: Journal of Symbolic Computatio
Implicitization of curves and (hyper)surfaces using predicted support
We reduce implicitization of rational planar parametric curves and (hyper)surfaces to linear algebra, by interpolating the coefficients of the implicit equation.
For predicting the implicit support, we focus on methods that exploit input and output structure in the sense of sparse (or toric) elimination theory, namely by computing the Newton polytope of the implicit polynomial, via sparse resultant theory.
Our algorithm works even in the presence of base points but, in this case, the implicit equation shall be obtained as a factor of the produced polynomial.
We implement our methods on Maple, and some on Matlab as well, and study their numerical stability and efficiency on several classes of curves and surfaces.
We apply our approach to approximate implicitization,
and quantify the accuracy of the approximate output,
which turns out to be satisfactory on all tested examples; we also relate our measures to Hausdorff distance.
In building a square or rectangular matrix, an important issue is (over)sampling the given curve or surface: we conclude that unitary complexes offer the best tradeoff between speed and accuracy when numerical methods are employed, namely SVD, whereas for exact kernel computation random integers is the method of choice.
We compare our prototype to existing software and find that it is rather competitive
Solving Polynomial Systems via a Stabilized Representation of Quotient Algebras
We consider the problem of finding the isolated common roots of a set of
polynomial functions defining a zero-dimensional ideal I in a ring R of
polynomials over C. We propose a general algebraic framework to find the
solutions and to compute the structure of the quotient ring R/I from the null
space of a Macaulay-type matrix. The affine dense, affine sparse, homogeneous
and multi-homogeneous cases are treated. In the presented framework, the
concept of a border basis is generalized by relaxing the conditions on the set
of basis elements. This allows for algorithms to adapt the choice of basis in
order to enhance the numerical stability. We present such an algorithm and show
numerical results
- …