Approximating the closest structured singular matrix polynomial

DOI10.1080/03081087.2024.2376561MaRDI QIDQ6939435zbMATH OpenFDO

Authors Miryam Gnazzo, Nicola Guglielmi

Publication date 21 August 2025

Published in Linear and Multilinear Algebra (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/03081087.2024.2376561

Mathematics Subject Classification ID

Eigenvalues, singular values, and eigenvectors (15A18) Matrix pencils (15A22) Norms of matrices, numerical range, applications of functional analysis to matrix theory (15A60) Functions whose values are linear operators (operator- and matrix-valued functions, etc., including analytic and meromorphic ones) (47A56) Numerical mathematical programming methods (65K05) Numerical optimization and variational techniques (65K10)

Cites work

• A Riemannian optimization method to compute the nearest singular pencil
• Block Kronecker linearizations of matrix polynomials and their backward errors
• Computation of the nearest structured matrix triplet with common null space
• Computing the nearest rank-deficient matrix polynomial
• Derivatives and Perturbations of Eigenvectors
• Distance problems for dissipative Hamiltonian systems and related matrix polynomials
• scientific article; zbMATH DE number 44365 (Why is no real title available?)
• scientific article; zbMATH DE number 1235881 (Why is no real title available?)
• scientific article; zbMATH DE number 6125590 (Why is no real title available?)
• scientific article; zbMATH DE number 961607 (Why is no real title available?)
• Linear and nonlinear programming.
• Linearization of DAEs along trajectories
• Nearest rank deficient matrix polynomials
• NLEVP, a collection of nonlinear eigenvalue problems
• On the Nearest Singular Matrix Pencil
• Rank-1 Matrix Differential Equations for Structured Eigenvalue Optimization.
• Recovering a perturbation of a matrix polynomial from a perturbation of its first companion linearization
• Stability of gyroscopic systems with respect to perturbations
• The eigenstructure of an arbitrary polynomial matrix: Computational aspects
• The numerical solution of differential-algebraic systems by Runge-Kutta methods
• Where is the nearest non-regular pencil?

Cited in

(2)

• On the numerical approximation of the distance to singularity for matrix-valued functions
• Inverse problems of polynomial and rational matrices involving the eigenstructure and data of the column and row spaces

This page was built for publication: Approximating the closest structured singular matrix polynomial

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6939435)