Abstract
We propose a numerical algorithm to compute a Jordan basis as well as the Jordan canonical form for matrices of block Schur form (BSF). Combining it with the standard preprocessing which reduces a square matrix to BSF, we establish an efficient numerical algorithm only with unitary processes to reveal a full detail of the Jordan structure for an arbitrarily given square matrix.
