Eigenvalue patterned condition numbers: Toeplitz and Hankel cases (Q2370674): Difference between revisions

The authors continues their study [J. Comput. Appl. Math. 185, No. 1, 174--189 (2006; Zbl 1086.65042)] concerning the sensitivity of simple eigenvalues of a matrix \(A\) to perturbations in \(A\) that belong to a chosen subspace of matrices. The present material focuses on patterned perturbations, the case of Toeplitz and Hankel matrices being investigated in detail. The first section is an overview of the paper cited above. The second section is devoted to an explanation of notation and terminology used in the paper. In the third section, the authors derive from the existing theory of structured conditioning [cf. \textit{D. J. Higham} and \textit{N. J. Higham}, Siam J. Matrix Anal. Appl. 20, No. 2, 493--512 (1998; Zbl 0935.65032); \textit{F. Tisseur}, ibid. 24, No. 3, 877--897 (2003; Zbl 1044.65030)] convenient expressions for the patterned condition number of a simple eigenvalue of a paterned matrix. Numerical tests performed on random patterned matrices are presented in the fourth section. The Toeplitz case and the Hankel case are treated. In the last section the authors update the theory in Section three to other families of patterned matrices: persymmetric and complex persymmetric, complex symmetric, skew-persymmetric and complex skew-persymmetric, and complex skew-symmetric.