16 research outputs found

    Dynamic programming and minimal norm solutions of least squares problems

    Get PDF

    The Bellman-Gauss principle for constrained motion

    Get PDF
    AbstractGauss' principle of least constraint is solved in a sequential fashion via dynamic programming in this paper. The solution itself constitutes a new principle for constrained motion, which we may name the Bellman-Gauss principle for constrained motion

    DOI: 10.1007/s10957-005-7496-7 Reflections on the Gauss Principle of Least Constraint

    Get PDF
    Abstract. The Gauss principle of least constraint is derived from a new point of view. Then, an extended principle of least constraint is derived to cover the case of nonideal constraints. Finally, a version of the principle for general underdetermined systems is adumbrated. Throughout, the notion of generalized inverses of matices plays a prominent role. Key Words. Gauss principle of least constraint, nonideal nonholonomic constraints, generalized inverses of matrices. 1
    corecore