Author:
Noferini Vanni,Poloni Federico
Abstract
AbstractWe study the problem of finding the nearest $$\varOmega $$
Ω
-stable matrix to a certain matrix A, i.e., the nearest matrix with all its eigenvalues in a prescribed closed set $$\varOmega $$
Ω
. Distances are measured in the Frobenius norm. An important special case is finding the nearest Hurwitz or Schur stable matrix, which has applications in systems theory. We describe a reformulation of the task as an optimization problem on the Riemannian manifold of orthogonal (or unitary) matrices. The problem can then be solved using standard methods from the theory of Riemannian optimization. The resulting algorithm is remarkably fast on small-scale and medium-scale matrices, and returns directly a Schur factorization of the minimizer, sidestepping the numerical difficulties associated with eigenvalues with high multiplicity.
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computational Mathematics
Reference39 articles.
1. Absil, P.-A., Mahony, R., Sepulchre, R.: Optimization Algorithms on Matrix Manifolds. Princeton University Press, Princeton, NJ (2008)
2. Andrea F. et al. Finding the nearest matrix with real eigenvalues. https://mathoverflow.net/questions/273669/finding-the-nearest-matrix-with-real-eigenvalues. Post on the Q&A site Mathoverflow (2017)
3. Arslan, B., Noferini, V., Tisseur, F.: The structured condition number of a differentiable map between matrix manifolds, with applications. SIAM J. Matrix Anal. Appl. 40(2), 774–799 (2019)
4. Benner, P., Mitchell, T.: Extended and improved criss-cross algorithms for computing the spectral value set abscissa and radius. SIAM J. Matrix Anal. Appl. 40(4), 1325–1352 (2019)
5. Boumal, N., Mishra, B., Absil, P.-A., Sepulchre, R.: Manopt, a matlab toolbox for optimization on manifolds. J. Mach. Learn. Res. 15, 1455–1459 (2014)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献