A Computational Study of the Use of an Optimization-Based Method for Simulating Large Multibody Systems

TitleA Computational Study of the Use of an Optimization-Based Method for Simulating Large Multibody Systems
Publication TypeJournal Article
Year of Publication2007
AuthorsPetra, CG, Gavrea, BI, Anitescu, M, Potra, FA
Date Published12/2007
Other NumbersANL/MCS-P1495-0508
Abstract

The present work aims at comparing the performance of several quadratic programming (QP) solvers for simulating large-scale frictional rigid-body systems. Traditional time-stepping schemes for simulation of multibody systems are formulated as linear complementarity problems (LCPs) with copositive matrices. Such LCPs are generally solved by means of Lemketype algorithms and solvers such as the PATH solver proved to be robust. However, for large systems, the PATH solver or any other pivotal algorithm becomes unpractical from a computational point of view. The convex relaxation proposed by one of the authors allows the formulation of the integration step as a quadratic program, for which a wide variety of state-of-the-art solvers are available. In what follows we report the results obtained solving that subproblem when using the QP solvers MOSEK, OOQP, TRON, and BLMVM. OOQP is presented with both the symmetric indefinite solver MA27 and our Cholesky reformulation using the CHOLMOD package. We investigate computational performance and address the correctness of the results from a modeling point of view. We conclude that the OOQP solver, particularly with the CHOLMOD linear algebra solver, has predictable performance and memory use patterns and is far more competitive for these problems than are the other solvers.

PDFhttp://www.mcs.anl.gov/papers/P1495.pdf