Cornell University
Library
Cornell UniversityLibrary

eCommons

Help
Log In(current)
  1. Home
  2. Cornell Computing and Information Science
  3. Computer Science
  4. Computer Science Technical Reports
  5. How Near is a Stable Matrix to an Unstable Matrix?

How Near is a Stable Matrix to an Unstable Matrix?

File(s)
84-649.pdf (1.19 MB)
84-649.ps (322.28 KB)
Permanent Link(s)
https://hdl.handle.net/1813/6488
Collections
Computer Science Technical Reports
Author
Van Loan, Charles
Abstract

In this paper we explore how close a given stable matrix A is to being unstable. As a measure of "how stable" a stable matrix is, the spectral abscissa is shown to be flawed. A better measure of stability is the Frobenius norm of the smallest perturbation that shifts one of A's eigenvalues to the imaginary axis. This leads to a singular value minimization problem that can be approximately solved by heuristic means. However, the minimum destabilizing perturbation may be complex even when A is real. This suggests that in the real case we look for the smallest real perturbation that shifts one of the eigenvalues to the imaginary axis. Unfortunately, a difficult constrained minimization problem ensues and no practical estimation technique could be devised.

Date Issued
1984-10
Publisher
Cornell University
Keywords
computer science
•
technical report
Previously Published as
http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR84-649
Type
technical report

Site Statistics | Help

About eCommons | Policies | Terms of use | Contact Us

copyright © 2002-2026 Cornell University Library | Privacy | Web Accessibility Assistance