Local Generic Position for Root Isolation of Zero-dimensional Triangular Polynomial Systems
Résumé
We present an algorithm based on local generic position (LGP) to isolate the complex or real roots and their multiplicities of a zero-dimensional triangular polynomial system. The Boolean complexity of the algorithm for computing the real roots is single exponential: ˜OB(Nn2), where N=max{d,τ}, d and τ, is the degree and the maximum coefficient bitsize of the polynomials, respectively, and n is the number of variables.
Domaines
Calcul formel [cs.SC]Origine | Fichiers produits par l'(les) auteur(s) |
---|
Loading...