Null-space computation for qLPV systems*

Computation of the nullspace of a quasi linear parameter varying system (qLPV) bears significant importance in several fields of control theory such as fault detection design or reconfigurable control design. While for linear time invariant systems computation of the stable nullspaces can be efficiently handled based on matrix pencil techniques, for more general cases, such as qLPV systems, such algorithms are not available. The paper provides a general scheme for the construction of the stable nullspaces that can be followed not only for dynamic (LTI, LTV, qLPV) systems but also in the case of memoryless, parameter varying matrices. The reliability of the proposed method for practical computations is also discussed. The algorithm is illustrated through small examples.