An upper bound for the spectral condition number of a diagonalizable matrix

By constructing a special similarity transformation matrix, an upper bound for the spectral condition number of a diagonalizable matrix is obtained. This bound can be used in the QR algorithm to estimate the accuracy of the computed eigenvalues.