Distances from a Hermitian pair to diagonalizable and nondiagonalizable Hermitian pairs

CK Li, Roy Mathias

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

Let W(T) and r(T) denote the numerical range and numerical radius of an n x n complex matrix T. Let H-n(2) denote the space of pairs of n x n Hermitian matrices. Define a norm on H-n(2) by parallel to(X, Y)parallel to = r(X + iY). Take (A, B) is an element of H-n(2). It is shown that if 0 is an element of W(A + iB), then inf{\mu\ : mu is not an element of W(A + iB)} is an upper bound on the distance to the nearest pair that is simultaneously diagonalizable by congruence. If 0 is not an element of W(A + iB), then min{\mu\ : mu is an element of W(A + iB)}, which is the Crawford number of the pair (A, B), is equal to the distance to the nearest pair that is not simultaneously diagonalizable by congruence. The results are similar when the numerical radius is replaced by the spectral norm.
Original languageEnglish
Pages (from-to)301-305
Number of pages5
JournalS I A M Journal on Matrix Analysis and Applications
Volume28
Issue number2
DOIs
Publication statusPublished - 1 Jan 2006

Keywords

  • numerical radius
  • numerical range
  • nondiagonalizable
  • Crawford number
  • definite Hermitian pair

Fingerprint

Dive into the research topics of 'Distances from a Hermitian pair to diagonalizable and nondiagonalizable Hermitian pairs'. Together they form a unique fingerprint.

Cite this