A fast and stable parallel QR algorithm for symmetric tridiagonal matrices
A parallel algorithm based on a divide and conquer method is proposed for computing a few eigenvalues of a symmetric tridiagonal matrix. No common memory is assumed. The authors discuss the numerical stability properties of their algorithm and provide numerical examples.
scientific article; zbMATH DE number 769019
scientific article