Computational aspects of deciding if all roots of a polynomial lie within the unit circle (Q1223130): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON THE DISTRIBUTION OF THE ZEROS OF A POLYNOMIAL / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Euclid's Algorithm and the Theory of Subresultants / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subresultants and Reduced Polynomial Remainder Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Calculation of Multivariate Polynomial Resultants / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Arithmetic Algorithms for Polynomial Real Zero Determination / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the modified stability table for linear discrete time systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5585021 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On homotopic mappings of Riemann surfaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast modular transforms / rank
 
Normal rank

Revision as of 18:09, 12 June 2024

scientific article
Language Label Description Also known as
English
Computational aspects of deciding if all roots of a polynomial lie within the unit circle
scientific article

    Statements