A Unit-Consistent Error Measure for Mixed Linear Complementarity Problems in Multibody Dynamics With Contact

Author(s):  
Andreas Enzenhöfer ◽  
Albert Peiret ◽  
Marek Teichmann ◽  
József Kövecses

Modeling multibody systems subject to unilateral contacts and friction efficiently is challenging, and dynamic formulations based on the mixed linear complementarity problem (MLCP) are commonly used for this purpose. The accuracy of the MLCP solution method can be evaluated by determining the error introduced by it. In this paper, we find that commonly used MLCP error measures suffer from unit inconsistency leading to the error lacking any physical meaning. We propose a unit-consistent error measure which computes energy error components for each constraint dependent on the inverse effective mass and compliance. It is shown by means of a simple example that the unit consistency issue does not occur using this proposed error measure. Simulation results confirm that the error decreases with convergence toward the solution. If a pivoting algorithm does not find a solution of the MLCP due to an iteration limit, e.g. in real-time simulations, choosing the result with the least error can reduce the risk of simulation instabilities.

2019 ◽  
Vol 14 (5) ◽  
Author(s):  
Andreas Enzenhöfer ◽  
Albert Peiret ◽  
Marek Teichmann ◽  
József Kövecses

Modeling multibody systems subject to unilateral contacts and friction efficiently is challenging, and dynamic formulations based on the mixed linear complementarity problem (MLCP) are commonly used for this purpose. The accuracy of the MLCP solution method can be evaluated by determining the error introduced by it. In this paper, we find that commonly used MLCP error measures suffer from unit inconsistency leading to the error lacking any physical meaning. We propose a unit-consistent error measure, which computes energy error components for each constraint dependent on the inverse effective mass and compliance. It is shown by means of a simple example that the unit consistency issue does not occur using this proposed error measure. Simulation results confirm that the error decreases with convergence toward the solution. If a pivoting algorithm does not find a solution of the MLCP due to an iteration limit, e.g., in real-time simulations, choosing the result with the least error can reduce the risk of simulation instabilities and deviation from the reference trajectory.


2012 ◽  
Vol 2012 ◽  
pp. 1-15
Author(s):  
Hongchun Sun ◽  
Yiju Wang

For the extended mixed linear complementarity problem (EML CP), we first present the characterization of the solution set for the EMLCP. Based on this, its global error bound is also established under milder conditions. The results obtained in this paper can be taken as an extension for the classical linear complementarity problems.


2018 ◽  
Vol 35 (05) ◽  
pp. 1850035
Author(s):  
S. K. Neogy ◽  
Prasenjit Mondal ◽  
Abhijit Gupta ◽  
Debasish Ghorui

Two classical pivoting algorithms, due to Lemke and Cottle–Dantzig, are studied on linear complementarity problems (LCPs) and their generalizations that arise from infinite duration two-person mean payoff games (MPGs) under zero-mean partition problem. Lemke’s algorithm was studied in solving MPGs via reduction to discounted payoff games or to simple stochastic games. We provide an alternative and efficient approach for studying the LCPs arising from the MPGs without any reduction. A binary MPG can easily be formulated as an LCP which has always terminated in a complementary solution in numerical experiments, but has not yet been proven either the processability of MPG’s by Lemke’s algorithm or a counter example that it will not terminate with a solution. Till now, the processability of MPG’s by Lemke’s algorithm remains open. A general MPG (with arbitrary outgoing arcs) naturally reduces to a generalized linear complementarity problem (GLCP) involving a rectangular matrix where the vertices are represented by the columns and the outgoing arcs from each vertex are represented by rows in a particular block. The noteworthy result in this paper is that the GLCP obtained from an MPG is processable by Cottle–Dantzig principal pivoting algorithm which terminates with a solution. Several properties of the matrix which arise in this context are also discussed.


2019 ◽  
Vol 17 (1) ◽  
pp. 1599-1614
Author(s):  
Zhiwu Hou ◽  
Xia Jing ◽  
Lei Gao

Abstract A new error bound for the linear complementarity problem (LCP) of Σ-SDD matrices is given, which depends only on the entries of the involved matrices. Numerical examples are given to show that the new bound is better than that provided by García-Esnaola and Peña [Linear Algebra Appl., 2013, 438, 1339–1446] in some cases. Based on the obtained results, we also give an error bound for the LCP of SB-matrices. It is proved that the new bound is sharper than that provided by Dai et al. [Numer. Algor., 2012, 61, 121–139] under certain assumptions.


Sign in / Sign up

Export Citation Format

Share Document