Finding the nearest -stable pencil with Riemannian optimization

Abstract

This paper considers the problem of finding the nearest -stable pencil to a given square pencil A+xB ∈ Cn × n, where a pencil is called -stable if it is regular and all of its eigenvalues belong to the closed set . We propose a new method, based on the Schur form of a matrix pair and Riemannian optimization over the manifold U(n) × U(n), that is, the Cartesian product of the unitary group with itself. While the developed theory holds for any closed set , we focus on two cases that are the most common in applications: Hurwitz stability and Schur stability. For these cases, we develop publicly available efficient implementations. Numerical experiments show that the resulting algorithm outperforms existing methods.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…