On computing minimal proper nullspace bases with applications in fault detection

Abstract

We discuss computationally efficient and numerically reliable algorithms to compute minimal proper nullspace bases of a rational or polynomial matrix. The underlying main computational tool is the orthogonal reduction to a Kronecker-like form of the system matrix of an equivalent descriptor system realization. A new algorithm is proposed to compute a simple minimal proper nullspace basis, starting from a non-simple one. Minimal dynamic cover based computational techniques are used for this purpose. The discussed methods allow a high flexibility in addressing several fault detection related applications.