Improving the solution of the symmetric eigenvalue problem and an extension

Abstract

Based on a multipoint approximation of polynomial values, we accelerate the bisection and divide-and-conquer algorithms for the symmetric eigenvalue problem. We also propose a new extension of the bisection algorithm to the unsymmetric eigenvalue problem.