z-logo
open-access-imgOpen Access
An algorithm for solving zero-dimensional parametric systems of polynomial homogeneous equations
Author(s) -
Ali Ayad,
Ali Farés,
Youssef Ayyad
Publication year - 2012
Publication title -
the journal of nonlinear sciences and applications
Language(s) - English
Resource type - Journals
eISSN - 2008-1901
pISSN - 2008-1898
DOI - 10.22436/jnsa.005.06.03
Subject(s) - mathematics , zero (linguistics) , homogeneous , parametric statistics , polynomial , homogeneous polynomial , matrix polynomial , algorithm , mathematical analysis , combinatorics , statistics , philosophy , linguistics
This paper presents a new algorithm for solving zero-dimensional parametric systems of polynomial homogeneous equations. This algorithm is based on the computation of what we call parametric U -resultants. The parameters space, i.e., the set of values of the parameters is decomposed into a finite number of constructible sets. The solutions of the input polynomial system are given uniformly in each constructible set by Polynomial Univariate Representations. The complexity of this algorithm is single exponential in the number n of the unknowns and the number r of the parameters.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom