Weylʹs quadtree algorithm for the unsymmetric eigenvalue problem Original Research Article

Wyelʹs quadtree algorithm was proposed in 1924 for approximating polynomial zeros. We extend it to the unsymmetric eigenvalue problem; the extension relies on the heuristic proximity test based on the known correlation between the reciprocal of the norm of matrix inverse and the distance from the matrix to the closest singular matrix.