Title : 
Root clustering for convex combination of complex polynomials
         
        
        
            Author_Institution : 
Dept. of Mech. Eng., Technion-Israel Inst. of Technol., Haifa, Israel
         
        
        
        
        
            fDate : 
10/1/1992 12:00:00 AM
         
        
        
        
            Abstract : 
In some important applications, such as the edge-theorem, it is required that a polynomial is α-stable along a parameter segment. Using the critical constraint, the necessary and sufficient conditions for root clustering (α-stability) of convex combinations of complex polynomials are presented. The approach is general and requires that a certain real polynomial has no zeros in the open interval (0,1)
         
        
            Keywords : 
poles and zeros; polynomials; stability criteria; α-stability; complex polynomials; convex polynomial combination; critical constraint; edge-theorem; necessary and sufficient conditions; root clustering; zeros; Automatic control; Kalman filters; MIMO; Matrix decomposition; Minimization methods; Numerical stability; Polynomials; Roundoff errors; Singular value decomposition; Transfer functions;
         
        
        
            Journal_Title : 
Automatic Control, IEEE Transactions on