Computing the regularization of a linear differential–algebraic system

We study the regularization problem for linear differential–algebraic systems. As an improvement of former results we show that any system can be regularized by a combination of state-space and input-space transformations, behavioral equivalence transformations and a reorganization of variables. The additional state feedback which is needed in earlier publications is shown to be superfluous. We provide an algorithmic procedure for the construction of the regularization and discuss computational aspects.