A complete discrimination system for polynomials with complex coefficients and its automatic generation

DOI10.1007/BF02917106zbMath0949.12002MaRDI QIDQ1303099

Songxin Liang, Jing-Zhong Zhang

Publication date: 5 December 2000

Published in: Science in China. Series E (Search for Journal in Brave)

zbMATH Keywords

polynomialspositive definitenesssubresultantsMaplepolynomials in two variablescomplex zeros with no conjugatenumbers of real zerospairs of complex conjugate zeros

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Polynomials in general fields (irreducibility, etc.) (12E05)

Related Items (11)

Automatic computation of the complete root classification for a parametric polynomial ⋮ Computation of Green's functions through algebraic decomposition of operators ⋮ A complete algorithm for automated discovering of a class of inequality-type theorems ⋮ An improved algorithm for deciding semi-definite polynomials ⋮ Uniqueness of equilibrium in the haber synthesis of ammonia ⋮ An effective decision method for semidefinite polynomials ⋮ A condition for multiplicity structure of univariate polynomials ⋮ Solution formulas for cubic equations without or with constraints ⋮ Extended Jury criterion ⋮ Recent advances on determining the number of real roots of parametric polynomials ⋮ A recursive algorithm for constructing generalized Sturm sequence

Uses Software

• Maple
• QEPCAD

Cites Work

• A complete discrimination system for polynomials
• Polynomial algorithms in computer algebra
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A complete discrimination system for polynomials with complex coefficients and its automatic generation