On the problem of feedback linearization

The paper studies and solves in a geometric framework the problem of partial feedback linearization for discrete-time dynamics. An algorithm for computing the largest linearizable subsystem is proposed. This approach can be considered as dual to the one already proposed in literature in an algebraic context