ON SOME ASPECTS OF THE DISCRETIZATION OF THE SUSLOV PROBLEM

In this paper we explore the discretization of Euler-Poincare-Suslov equations on SO(3), i.e. of the Suslov problem. We show that the consistency order corresponding to the unreduced and reduced setups, when the discrete reconstruction equation is given by a Cayley retraction map, are related to each other in a nontrivial way. We give precise conditions under which general and variational integrators generate a discrete flow preserving the constraint distribution. We establish general consistency bounds and illustrate the performance of several discretizations by some plots. Moreover, along the lines of [11 we show that any constraints-preserving discretization may be understood as being generated by the exact evolution map of a time-periodic non-autonomous perturbation of the original continuous-time nonholonomic system.