This paper revisits the problem of checking the robust stability of matrix families generated by ‘Unstructured Convex Combinations’ of user supplied or externally supplied Vertex Matrices. A previous solution given by the author for this problem involved complete dependence on the quantitative (eigenvalue information) of a set of special matrices labeled the Kronecker Nonsingularity (KN) matrices. In this solution, the ‘convexity’ property is not explicit and transparent, to the extent that, unfortunately, the accuracy of the solution itself is being questioned and not embraced by the peer community. To erase this unforunate and unwarranted image of this author (in this specific problem) in the minds of the peer community, in this paper, the author treads a new path to find a solution that brings out the convexity property in an explicit and understandable way. In the new solution presented in this paper, we combine the qualitative (sign) as well as quantitative (magnitude) information of these KN matrices and present a vertex solution in which the convexity property of the solution is transparent making it more elegant and accepatble to the peer community, than the previous solution. The new solution clearly underscores the importance of using the sign structure of a matrix in assessing the stability of a matrix. This new solution is made possible by the new insight provided by the qualitative (sign) stability/instability derived from ecological principles. Examples are given which clearly demonstrate effectiveness of the new, convexity based algorithm. It is hoped that this new solution will be embraced by the peer community.

This content is only available via PDF.
You do not currently have access to this content.