## Abstract

Let A be a matrix with distinct eigenvalues and let w(A) be the distance from A to the set of defective matrices (using either the 2-norm or the Frobenius norm). Define ^{Λ}, the -pseudospectrum of A, to be the set of points in the complex plane which are eigenvalues of matrices A+E with E<, and let c(A) be the supremum of all with the property that ^{Λ} has n distinct components. Demmel and Wilkinson independently observed in the 1980s that w(A)≥c(A), and equality was established for the 2-norm by Alam and Bora (2005). We give new results on the geometry of the pseudospectrum near points where first coalescence of the components occurs, characterizing such points as the lowest generalized saddle point of the smallest singular value of A-zI over z∈C. One consequence is that w(A)=c(A) for the Frobenius norm too, and another is the perhaps surprising result that the minimal distance is attained by a defective matrix in all cases. Our results suggest a new computational approach to approximating the nearest defective matrix by a variant of Newton's method that is applicable to both generic and nongeneric cases. Construction of the nearest defective matrix involves some subtle numerical issues which we explain, and we present a simple backward error analysis showing that a certain singular vector residual measures how close the computed matrix is to a truly defective matrix. Finally, we present a result giving lower bounds on the angles of wedges contained in the pseudospectrum and emanating from generic coalescence points. Several conjectures and questions remain open.

Original language | English (US) |
---|---|

Pages (from-to) | 494-513 |

Number of pages | 20 |

Journal | Linear Algebra and Its Applications |

Volume | 435 |

Issue number | 3 |

DOIs | |

State | Published - Aug 1 2011 |

## Keywords

- Multiple eigen values
- Pseudospectrum
- Saddle point

## ASJC Scopus subject areas

- Algebra and Number Theory
- Numerical Analysis
- Geometry and Topology
- Discrete Mathematics and Combinatorics