Abstract: In this paper, we present an algorithm for computing a
Schur factorization of a real nonsymmetric matrix with ordered diagonal
blocks such that upper left blocks contains the largest magnitude
eigenvalues. Especially in case of multiple eigenvalues, when matrix
is non diagonalizable, we construct an invariant subspaces with few
additional tricks which are heuristic and numerical results shows the
stability and accuracy of the algorithm.