From: //noreply@axelvogt.de   
      
   On 05.04.2016 18:47, clicliclic@freenet.de wrote:   
   >   
   > Here is a scheme for the exact computation of the number of complex   
   > roots that a given polynomial has within some arbitrary open disc in the   
   > complex plane:   
   >   
   > Ph. Saux Picart, The Schur–Cohn Algorithm Revisited:   
   >   
   >    
   >   
   > C. Brunie and Ph. Saux Picart, A Fast Version of the Schur–Cohn   
   > Algorithm:   
   >   
   >    
   >   
   > The scheme is not very hard to implement and quite useful to have   
   > readily available. But perhaps one of the free Computer Algebra systems   
   > offers something like this already?   
   >   
   > Martin.   
   >   
      
   Why not using the classical zero counting integral numerically?   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)