Estimation of structured distances to singularity for matrix pencils with symmetry structures: a linear algebra-based approach

DOI10.1137/21M1423269zbMATH Open1490.15021arXiv2105.13656OpenAlexW3166042201MaRDI QIDQ5863876FDOQ5863876

Authors: Anshul Prajapati, Punit Sharma 

Publication date: 3 June 2022

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Abstract: We study the structured distance to singularity for a given regular matrix pencil $A+sE$, where $(A,E)inmathbbSsubseteq(mathbb{C}^{n,n}{)}^2$. This includes Hermitian, skew-Hermitian, $\ast$-even, $\ast$-odd, $\ast$-palindromic, T-palindromic, and dissipative Hamiltonian pencils. We present a purely linear algebra-based approach to derive explicit computable formulas for the distance to the nearest structured pencil $(A-Delt{a}_A)+s(E-Delt{a}_E)$ such that $A-Delt{a}_A$ and $E-Delt{a}_E$ have a common null vector. We then obtain a family of computable lower bounds for the unstructured and structured distances to singularity. Numerical experiments suggest that in many cases, there is a significant difference between structured and unstructured distances. This approach extends to structured matrix polynomials with higher degrees.

Full work available at URL: https://arxiv.org/abs/2105.13656

Recommendations

• On the distance to singularity via low rank perturbations
• The structured distance to singularity of a symmetric tridiagonal Toeplitz matrix
• The gap distance to the set of singular matrix pencils
• On the Nearest Singular Matrix Pencil
• Structured perturbation analysis of sparse matrix pencils with \(s\)-specified eigenpairs

zbMATH Keywords

differential-algebraic systemdistance to singularitydissipative Hamiltonian systemstructured matrix pencilsstructured distance to singularitydistance to common null spaceeigenvalue backward errors

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Hermitian, skew-Hermitian, and related matrices (15B57) Matrix pencils (15A22)

Cites Work

• Structured Polynomial Eigenvalue Problems: Good Vibrations from Good Linearizations
• Analytic perturbation theory for matrices and operators. Licensed ed
• The autonomous linear quadratic control problem. Theory and numerical solution
• Smith forms of palindromic matrix polynomials
• Damped oscillations of linear systems. A mathematical introduction
• Title not available (Why is that?)
• Structured Mapping Problems for Matrices Associated with Scalar Products. Part I: Lie and Jordan Algebras
• On condition numbers and the distance to the nearest ill-posed problem
• Port-Hamiltonian systems: an introductory survey
• On the distance to singularity via low rank perturbations
• An extension of the positive real lemma to descriptor systems
• Accurate Solutions of Ill-Posed Problems in control theory
• \(\mu \)-values and spectral value sets for linear perturbation classes defined by a scalar product
• Structured eigenvalue backward errors of matrix pencils and polynomials with Hermitian and related structures
• Parameter-dependent rank-one perturbations of singular Hermitian or symmetric pencils
• Where is the nearest non-regular pencil?
• Structured eigenvalue backward errors of matrix pencils and polynomials with palindromic structures
• Computing the nearest stable matrix pairs.
• Distance problems for dissipative Hamiltonian systems and related matrix polynomials
• Stability radii for linear Hamiltonian systems with dissipation under structure-preserving perturbations
• The gap distance to the set of singular matrix pencils
• On the Nearest Singular Matrix Pencil
• Structured backward errors for eigenvalues of linear port-Hamiltonian descriptor systems
• Low-rank perturbation of regular matrix pencils with symmetry structures

Cited In (5)

• Variational Characterization of Monotone Nonlinear Eigenvector Problems and Geometry of Self-Consistent Field Iteration
• On the distance to singularity via low rank perturbations
• Computation of the nearest structured matrix triplet with common null space
• A Riemannian optimization method to compute the nearest singular pencil
• The gap distance to the set of singular matrix pencils

Uses Software

• CVX

This page was built for publication: Estimation of structured distances to singularity for matrix pencils with symmetry structures: a linear algebra-based approach

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