We present a new algorithm for solving the Sylvester-Observer Equation: AX ? XH = (0;C). The algorithm embodies two main computational phases: the solution of a series of independent equation systems, and a series of matrix-matrix multiplications. The algorithm is, thus, well suited for parallel and high performance computing. By reducingthe coeecient matrix A to lower Hessenberg form, one can ...