All known algorithms for singular pencils compute an essentially
complete Kronecker-Schur form of dense matrices ,
so little advantage can be taken of sparsity or
when only partial information is desired. Eigenvalues, reducing
subspaces, and their condition numbers may be computed.