Abstract
By establishing a complete discrimination system for polynomials, the problem of complete root classification for polynomials with complex coefficients is utterly solved, furthermore, the algorithm obtained is made into a general program in Maple, which enables the complete discrimination system and complete root classification of a polynomial to be automatically generated by computer, without any human intervention. Besides, by using the automatic generation of root classification, a method to determine the positive definiteness of a polynomial in one or two indeterminates is automatically presented.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have