 They reduce the problem of computing the nodes of a Gaussian quadrature rule to the problem of finding the eigenvalues of a particular symmetric tridiagonal matrix.The QR algorithm is used to find the eigenvalues of this matrix.By taking advantage of the symmetric tridiagonal structure, the eigenvalues can be computed in formula_11 time, as opposed to the formula_12 time expected for a generic eigenvalue problem.