grandes-ecoles 2013 Q20

grandes-ecoles · France · x-ens-maths__pc Matrices Eigenvalue and Characteristic Polynomial Analysis
In the optimal version of the Jacobi algorithm, we choose for each $m$ a pair $(p_m, q_m)$ such that the absolute value of the coefficient $\sigma_{ij}^{(m)}$ is maximal precisely when $(i,j) = (p_m, q_m)$. In other words, $$\forall i < j, \quad \left|\sigma_{ij}^{(m)}\right| \leqslant \left|\sigma_{p_m q_m}^{(m)}\right|$$
Show then that the diagonal coefficients of $D$ are the eigenvalues of $\Sigma$.
In the optimal version of the Jacobi algorithm, we choose for each $m$ a pair $(p_m, q_m)$ such that the absolute value of the coefficient $\sigma_{ij}^{(m)}$ is maximal precisely when $(i,j) = (p_m, q_m)$. In other words,
$$\forall i < j, \quad \left|\sigma_{ij}^{(m)}\right| \leqslant \left|\sigma_{p_m q_m}^{(m)}\right|$$

Show then that the diagonal coefficients of $D$ are the eigenvalues of $\Sigma$.