In applications, there is not only a requirement for eigenvalues and eigenvectors of matrices; beyond that it is often required to have the eigenvalues of combinations of matrices, such as their sums or products. These quantites are evidently related to those of the constituents, but not always in a way which is easily seen. It is still possible to work out some guidelines.
Consider two matrices and , normal if you will, and their convex linear combination, by which we mean, for a parameter varying between zero and one. If the two matrices commute there is no problem: there is a coordinate system in which they are simultaneously diagonal, the eigenvalues and can be listed in order so that we know which pair attach to the same eigenvector, and the new eigenvalues are
If and are changed ever so little, they may no longer commute, changing this picture, although the indexing scheme may still persist. For some insight into what may happen, consider that is a diagonal matrix with eigenvalues 1 and -1, and that is skewdiagonal, but symmetric with 1's in the corners, so that its eigenvalues are also 1 and -1. We are therefore interested in the matrix
whose characteristic equation is