A Riemannian optimization method to compute the nearest singular pencil
From MaRDI portal
Publication:6641762
DOI10.1137/23m1596326MaRDI QIDQ6641762
Unnamed Author, Vanni Noferini, Froilán M. Dopico
Publication date: 21 November 2024
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
minimal indicessingular matrix pencilregular matrix pencilgeneralized Schur formoptimization on matrix manifoldsnearness matrix problems
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical optimization and variational techniques (65K10) Eigenvalues, singular values, and eigenvectors (15A18) Numerical computation of determinants (65F40) Matrix pencils (15A22)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Wilkinson's bus: weak condition numbers, with an application to singular polynomial eigenproblems
- Where is the nearest non-regular pencil?
- Nearest \(\Omega \)-stable matrix via Riemannian optimization
- Root polynomials and their role in the theory of matrix polynomials
- Software for weighted structured low-rank approximation
- Trust-region methods on Riemannian manifolds
- Singular quadratic eigenvalue problems: linearization and weak condition numbers
- Manopt, a Matlab toolbox for optimization on manifolds
- Distance Problems for Linear Dynamical Systems
- Minimal Bases of Rational Vector Spaces, with Applications to Multivariable Linear Systems
- A Note on Generic Kronecker Orbits of Matrix Pencils with Fixed Rank
- The generalized eigenstructure problem in linear system theory
- An Introduction to Optimization on Smooth Manifolds
- Computing the Nearest Rank-Deficient Matrix Polynomial
- Analysis of the gradient method with an Armijo–Wolfe line search on a class of non-smooth convex functions
- The Structured Condition Number of a Differentiable Map between Matrix Manifolds, with Applications
- Solving Singular Generalized Eigenvalue Problems by a Rank-Completing Perturbation
- Canonical Forms for Hermitian Matrix Pairs under Strict Equivalence and Congruence
- On the Nearest Singular Matrix Pencil
- An Extrinsic Look at the Riemannian Hessian
- On the Sensitivity of the Eigenvalue Problem $Ax = \lambda Bx$
- Estimation of Structured Distances to Singularity for Matrix Pencils with Symmetry Structures: A Linear Algebra--Based Approach
- Nearest rank deficient matrix polynomials
This page was built for publication: A Riemannian optimization method to compute the nearest singular pencil