A complete discrimination system for polynomials with complex coefficients and its automatic generation (Q1303099): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(6 intermediate revisions by 4 users not shown) | |||
Property / author | |||
Property / author: Jing-Zhong Zhang / rank | |||
Property / author | |||
Property / author: Jing-Zhong Zhang / rank | |||
Normal rank | |||
Property / describes a project that uses | |||
Property / describes a project that uses: Maple / rank | |||
Normal rank | |||
Property / describes a project that uses | |||
Property / describes a project that uses: QEPCAD / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A complete discrimination system for polynomials / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4848888 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3136296 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4079605 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Polynomial algorithms in computer algebra / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 08:13, 29 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A complete discrimination system for polynomials with complex coefficients and its automatic generation |
scientific article |
Statements
A complete discrimination system for polynomials with complex coefficients and its automatic generation (English)
0 references
5 December 2000
0 references
Write the polynomial \(f(x)\) as \(f_1(x)+ if_2(x)\), where \(f_1\) and \(f_2\) have real coefficients. The authors give a method of determining the numbers of real zeros, pairs of complex conjugate zeros, and complex zeros with no conjugate (which can arise if \(f_2\) has some non-zero coefficients) of \(f\). The method is based on constructing sequences of numbers starting from the signs of determinants of subresultants of various polynomials and their derivatives. It has been implemented in Maple, and some run times are given. The authors also consider dealing with polynomials with literal coefficients and the problem of investigating the positive definiteness of polynomials in two variables. Proofs are not given, but are referred to from papers inaccessible to this reviewer. Examples, for reasons of space, are not given in full.
0 references
numbers of real zeros
0 references
pairs of complex conjugate zeros
0 references
complex zeros with no conjugate
0 references
subresultants
0 references
polynomials
0 references
Maple
0 references
positive definiteness
0 references
polynomials in two variables
0 references