Abstract

The principal concern of this paper is with real matrices whose undirected graphs are trees. To better understand potential stability of sign pattern classes, two simple criteria are given that preclude stability throughout a sign pattern class. In addition, those sign patterns that preclude eigenvalues with real part equal to 0 are characterized and the constant inertia within such classes is determined. Such tests may be computationally significant, as calculations with specific matrices may be subject to round off error uncertainties.

Full Text
Paper version not known

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 call

Disclaimer: 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.