Acceleration-level contact complementarity decides whether a smooth, closed contact with zero normal velocity must carry a compressive reaction or begin to separate. At and , the normal conditions are
They do not constrain the sign of acceleration at a positive gap, and they do not resolve an impact with negative incoming normal velocity. The distinction between smooth constrained dynamics and time-stepped contact/impact models is explicit in the primary dynamics treatment.[ref]
For a frictionless multibody model with generalized velocity , invertible mass matrix and contact Jacobian defined by , write
where is the free normal acceleration and . The normal reactions then solve the linear complementarity problem
The matrix couples contacts: choosing each reaction from a separate scalar formula generally fails when it changes acceleration at the other contacts. This formulation assumes the displayed velocity-coordinate kinematics and active closed contacts; additional friction forces modify the dynamics.
For an original coupled example, take free normal acceleration and
The reaction gives zero normal acceleration at both contacts. Ignoring the off-diagonal coupling would instead choose at each; inserted into the full system, that produces of outward acceleration at both loaded contacts and violates complementarity. Positive reaction and positive separating acceleration cannot coexist in this smooth active-contact model.
Because these are acceleration-level conditions, a numerical trajectory can still accumulate position or velocity drift. They must be paired with an integration/contact-update procedure that maintains the assumed state. During separated free flight, a negative acceleration can be perfectly admissible until the next contact event. At impact, an impulse and an appropriate velocity-level law are needed instead of applying the smooth equations across a discontinuity.
A linear complementarity problem asks for real vectors satisfying
for a prescribed real matrix and vector . The inequalities hold componentwise. Since every product is nonnegative, the final equality means for every index: each paired component has at least one zero. The linear complementarity problem is a feasibility problem; it need not come with an objective function. Its affine equation does not make the product condition linear.[ref]
For an original two-variable example, take
The pair and satisfies all three conditions. Guessing which member of each pair vanishes reduces the remaining equations to a candidate linear system, but each candidate must still satisfy nonnegativity. Choosing here gives and fails that check. Some data admit no solution: in one dimension, gives for every .
The connection with quadratic programming explains one important tractable case. For a symmetric matrix , consider
The Karush-Kuhn-Tucker conditions set its gradient equal to a nonnegative constraint multiplier and impose complementary slackness, giving precisely the displayed linear complementarity problem. If is a positive-definite matrix, the objective function is strictly convex and grows without bound as , so a unique minimizer exists. This conclusion uses that additional matrix property, not merely the word linear.
There is also a short uniqueness proof. For two complementary pairs,
Positive definiteness then forces . This argument gives a directly checkable reason for uniqueness in the stipulated case.
In unilateral contact complementarity, a nonnegative separation pairs with a nonnegative normal contact force: an open gap has zero contact reaction, while a positive reaction requires closed contact. A time-discretized rigid body model can relate its next-step gap affinely to the unknown reaction, producing a linear complementarity problem. The particular discretization and impact law determine that affine relation; the algebraic form alone does not select the physical contact model.[ref]