Mechanics of particles and systems Constraints and generalized coordinates Theorem
Udwadia–Kalaba equation
Builds on Generalized coordinatesGeneralized forceHolonomic constraintNonholonomic systemPositive definite matrixMoore–Penrose inverseGauss's principle of least constraint
Statement
Consider a mechanical system with generalized coordinates . Let be its mass matrix, a symmetric positive definite matrix, and let collect the given generalized forces. Without constraints the motion obeys . Suppose the system also obeys constraints, holonomic or nonholonomic. After differentiation in time, let them take the form , with an matrix and . Assume this linear system in is consistent. Assume the constraint forces are ideal, that is, they do no work in any virtual displacement with . Write for the unconstrained acceleration, for the positive definite square root of , and for the Moore–Penrose inverse of a matrix . Then the constrained motion satisfies and the force of constraint is .
Remarks
The proof uses Gauss's principle of least constraint: the actual minimizes subject to . With this asks for the solution of of least Euclidean norm, which is . The formula needs no independence of the constraints: may have dependent rows, and the Moore–Penrose inverse handles this. Example: take a particle of mass in the plane under gravity, so and , constrained to the circle . Differentiating the constraint twice gives . The formula then returns the pendulum equation, with the rod tension as constraint force. If the constraints are not ideal, an extra term for the work of the constraint forces must be added.
Going deeper
For a student
Unlike Lagrange's method with multipliers, the formula treats holonomic and nonholonomic constraints in one way and does not require the constraints to be independent. It is a closed-form version of Gauss's principle of least constraint and of Appell's equations. It is used in multibody dynamics and in control, where constraints may be imposed as desired trajectories.
Reading path
To understand this page from the ground up, read these 15 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Derivative concept
- Euclidean vector concept
- Euler–Lagrange equation concept
- Holonomic constraint concept
- Moore–Penrose inverse concept
- Positive definite matrix concept
- Smooth manifold concept
- Velocity concept
- d'Alembert's principle statement
- Configuration space concept
- Gauss's principle of least constraint statement
- Generalized coordinates concept
- Generalized force concept
- Nonholonomic system concept
- Udwadia–Kalaba equation statement
Further reading
About this page
| Tag | TXMWJ9R9RG |
|---|---|
| URI | m2://TXMWJ9R9RG |
| Kind | statement, theorem |
| Writing | W0 stub |
| MSC | 70F25, 70F20, 70G10 |
| Status | This copy of the site has no build data. Run m2 status TXMWJ9R9RG. |
| About | Nonholonomic system, Holonomic constraint |
| Uses | Generalized coordinates, Generalized force, Holonomic constraint, Nonholonomic system, Positive definite matrix, Moore–Penrose inverse, Gauss's principle of least constraint |
| Same as | |
| Changed | 3 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.