The calculation of the distance to a nearby defective matrix

SUMMARY The distance of a matrix to a nearby defective matrix is an important classical problem in numerical linear algebra, as it determines how sensitive or ill-conditioned an eigenvalue decomposition of a matrix is. The concept has been discussed throughout the history of numerical linear algebra, and the problem of computing the nearest defective matrix first appeared in Wilkinsons famous book on the algebraic eigenvalue problem. In this paper, a new fast algorithm for the computation of the distance of a matrix to a nearby defective matrix is presented. The problem is formulated following Alam and Bora introduced in (2005) and reduces to finding when a parameter-dependent matrix is singular subject to a constraint. The solution is achieved by an extension of the implicit determinant method introduced by Spence and Poulton in (2005). Numerical results for several examples illustrate the performance of the algorithm. Copyright © 2013 John Wiley & Sons, Ltd.

[1]  J. H. Wilkinson.  The algebraic eigenvalue problem , 1966 .

[2]  Pawel Hawrylak,et al.  Configuration interaction method for Fock–Darwin states , 2004 .

[3]  R. Alam,et al.  On sensitivity of eigenvalues and eigendecompositions of matrices , 2005 .

[4]  Alastair Spence,et al.  A Newton-based method for the calculation of the distance to instability , 2011 .

[5]  L. Trefethen,et al.  Spectra and pseudospectra : the behavior of nonnormal matrices and operators , 2005 .

[6]  M. O. Kaya,et al.  Supersonic flutter prediction of functionally graded panel , 2009, 2009 4th International Conference on Recent Advances in Space Technologies.

[7]  A. Edelman,et al.  The Computation and Sensitivity of Double Eigenvalues , 1998 .

[8]  J. Demmel.  A Numerical Analyst's Jordan Canonical Form. , 1983 .

[9]  L. Trefethen.  Spectra and pseudospectra , 2005 .

[10]  Michael L. Overton,et al.  Characterization and construction of the nearest defective matrix via coalescence of pseudospectral components , 2011 .

[11]  M. Ganapathi,et al.  Supersonic flutter characteristics of functionally graded flat panels including thermal effects , 2006 .

[12]  Wim Michiels,et al.  Computing all Pairs (λ, μ) Such That λ is a Double Eigenvalue of A+μB , 2011, SIAM J. Matrix Anal. Appl..

[13]  M. K. Singha,et al.  Supersonic flutter characteristics of composite cylindrical panels , 2008 .

[14]  Gene H. Golub,et al.  Matrix computations , 1983 .

[15]  Alastair Spence,et al.  Photonic band structure calculations using nonlinear eigenvalue techniques , 2005 .

[16]  J. Demmel.  Computing stable eigendecompositions of matrices , 1986 .

[17]  Peter W. Sauer,et al.  Is strong modal resonance a precursor to power system oscillations , 2001 .

[18]  M. Ganapathi,et al.  A parametric study on supersonic flutter behavior of laminated composite skew flat panels , 2005 .