  We propose an efficient algorithm for computing a common eigenvector of a
finite set of square matrices. As an immediate consequence we obtain an
algorithm for determining whether the matrices admit a simultaneous
triangulation, and, if so, for computing a corresponding basis.
