)For Hermitian matrices, the Divide-and-conquer eigenvalue algorithm is more efficient than the QR algorithm if both eigenvectors and eigenvalues are desired.Recall that the "geometric" multiplicity of an eigenvalue can be described as the dimension of the associated eigenspace, the nullspace of .