EFFICIENT NUMERICAL DIAGONALIZATION OF HERMITIAN 3 × 3 MATRICES
EFFICIENT NUMERICAL DIAGONALIZATION OF HERMITIAN 3 × 3 MATRICES
A very common problem in science is the numerical diagonalization of symmetric or hermitian 3 × 3 matrices. Since standard "black box" packages may be too inefficient if the number of matrices is large, we study several alternatives. We consider optimized implementations of the Jacobi, QL, and Cuppen algorithms and …