Computing the controllability function for nonlinear descriptor systems

The computation of the controllability function for nonlinear descriptor systems is considered. Three different methods are derived. The first method is based on the necessary conditions for optimality from the Hamilton-Jacobi-Bellman theory for descriptor systems. The second method uses completion of squares to find the solution. The third method gives a series expansion solution, which with a finite number of terms can serve as an approximate solution