Registered Data

[02200] Structured Distances to Nearest Singular Matrix Pencil

  • Session Time & Room : 1E (Aug.21, 17:40-19:20) @G304
  • Type : Contributed Talk
  • Abstract : We consider the structured distance to singularity for a given regular matrix pencil $A+sE$, where $(A,E)\in \mathbb S \subseteq (\mathbb{C}^{n,n})^2$. This includes Hermitian, skew-Hermitian, $*$-even, $*$-odd, $*$-palindromic, T-palindromic, and dissipative Hamiltonian pencils. We derive explicit computable formulas for the distance to the nearest structured pencil $(A-\Delta_A)+s(E-\Delta_E)$ such that $A-\Delta_A$ and $E-\Delta_E$ have a common null vector. We then obtain a family of computable lower bounds for the unstructured and structured distances to singularity.
  • Classification : 15A18, 15A22, 65K05
  • Format : Talk at Waseda University
  • Author(s) :
    • Anshul Prajapati (Indian Institute of Technology Delhi)
    • Punit Sharma (Indian Institute of Technology Delhi)