Efficient Algorithms for the Block Hessenberg Form

摘要

ew investigate in this paper the performance of parallel algorithms for computing the con- trollable part of a control linear system, with application to the computation of minimal realizations. Our approach is based on a method that transforms the matrices of the system to block Hessenberg Form by using rank-revealing orthogonal factorizations. The experimental analysis on a high performance architecture includes two rank-revealing numerical Tools: the SVD and the rank-revealing QR factorizations.