WEYLS QUADTREE ALGORITHM FOR THE UNSYMMETRIC EIGENVALUE PROBLEM

Wyel's quadtree algorithm was proposed in 1924 for approximating polyn omial zeros. We extend it to the unsymmetric eigenvalue problem; the e xtension relies on the heuristic proximity test based on the known cor relation between the reciprocal of the norm of matrix inverse and the distance from the matrix to the closest singular matrix.