Papers › Finding the nearest Ω-stable pencil with Riemannian optimization
Finding the nearest Ω-stable pencil with Riemannian optimization
Vanni Noferini, Lauri Nyman
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
This paper considers the problem of finding the nearest Ω-stable pencil to a given square pencil A+xB ∈ℂ^(n ×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.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections