Abstract
In the framework of the theory of linear matrix inequalities, a method is proposed for determining all the domains in the parameter space having the property that an affine family of symmetric matrices has the same fixed number of like-sign eigenvalues inside each of the domains. The approach leans on the ideas of D-decomposition; it is particularly efficient in the problems involving few parameters. Generalizations of the method are considered along with its modifications to the presence of uncertainty.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
