English

Computing nearest stable matrix pairs

Numerical Analysis 2018-12-19 v1 Optimization and Control

Abstract

In this paper, we study the nearest stable matrix pair problem: given a square matrix pair (E,A)(E,A), minimize the Frobenius norm of (ΔE,ΔA)(\Delta_E,\Delta_A) such that (E+ΔE,A+ΔA)(E+\Delta_E,A+\Delta_A) is a stable matrix pair. We propose a reformulation of the problem with a simpler feasible set by introducing dissipative Hamiltonian (DH) matrix pairs: A matrix pair (E,A)(E,A) is DH if A=(JR)QA=(J-R)Q with skew-symmetric JJ, positive semidefinite RR, and an invertible QQ such that QTEQ^TE is positive semidefinite. This reformulation has a convex feasible domain onto which it is easy to project. This allows us to employ a fast gradient method to obtain a nearby stable approximation of a given matrix pair.

Keywords

Cite

@article{arxiv.1704.03184,
  title  = {Computing nearest stable matrix pairs},
  author = {Nicolas Gillis and Volker Mehrmann and Punit Sharma},
  journal= {arXiv preprint arXiv:1704.03184},
  year   = {2018}
}

Comments

19 pages, 4 figures