Computing the nearest stable matrix pairs
Numerical Linear Algebra with Applications · 2018-10 · 25 (5)
DOI: 10.1002/nla.2153 ↗Kurz gefasst
Fachartikel in der Zeitschrift Numerical Linear Algebra with Applications, 2018-02. Verfasst von Nicolas Gillis und 2 weiteren Autor:innen. Die Arbeit wurde bisher 24-mal zitiert (Crossref) und nennt 29 Literaturangaben. Gefördert von: European Research Council.
Abstract (Originalsprache)
In this paper, we study the nearest stable matrix pair problem: given a square matrix pair ( E , A ), minimize the Frobenius norm of (Δ E ,Δ A ) such that ( E +Δ E , A +Δ A ) is a stable matrix pair. We propose a reformulation of the problem with a simpler feasible set by introducing dissipative Hamiltonian matrix pairs: A matrix pair ( E , A ) is dissipative Hamiltonian if A =( J − R ) Q with skew‐symmetric J , positive semidefinite R , and an invertible Q such that Q T E 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.
Förderung
- European Research Council
Zitieren
APA
Gillis, N., Mehrmann, V., & Sharma, P. (2018). Computing the nearest stable matrix pairs. Numerical Linear Algebra with Applications, 25(5). https://doi.org/10.1002/nla.2153
Vancouver
Gillis N, Mehrmann V, Sharma P. Computing the nearest stable matrix pairs. Numerical Linear Algebra with Applications. 2018;25(5). doi:10.1002/nla.2153
BibTeX
@article{Gillis2018,
author = {Gillis, Nicolas and Mehrmann, Volker and Sharma, Punit},
title = {Computing the nearest stable matrix pairs},
journal = {Numerical Linear Algebra with Applications},
year = {2018},
volume = {25},
number = {5},
doi = {10.1002/nla.2153}
}
EUVIMED