A complete discrimination system for polynomials with complex coefficients and its automatic generation
From MaRDI portal
Publication:1303099
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)
polynomialspositive definitenesssubresultantsMaplepolynomials in two variablescomplex zeros with no conjugatenumbers of real zerospairs of complex conjugate zeros
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
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
Cites Work
This page was built for publication: A complete discrimination system for polynomials with complex coefficients and its automatic generation
