Reaction uniqueness problem in the divide-and-conquer approach

Abstract When overconstrained multibody mechanisms are modeled as rigid body systems, some or all of the reaction forces are non-unique, which may affect other simulation results, making them incorrect. Despite this global ambiguity, unambiguously determinable reactions may be present in the system. For some multibody formulations, methods for checking which reactions are unique and which are non-unique are available. This paper presents a new version of the reaction uniqueness analysis approach based on the divide-and-conquer algorithm. In this method, single- and multi-joint connections are treated in the same way, and the approach does not require additional passes along a binary tree. The uniqueness test may be performed by considering the coefficient matrix (in full or reduced form)—after the main pass of the DCA is finished—by using one of the following numerical methods: rank comparison, QR decomposition, SVD, or nullspace approaches. All of them are considered in this article. The new approach can be applied to a broader class of mechanisms than the DCA-based method developed so far. Moreover, more complex reaction sets may be considered. A spatial parallelogram mechanism with a triple pendulum is studied to illustrate the approach. Furthermore, the proposed method is compared with different approaches to uniqueness analysis in terms of computational efficiency.

Authors

Institutions

Publication Details

Journal
Multibody System Dynamics
Published
2025-11-11
DOI
https://doi.org/10.1007/s11044-025-10122-9
Primary Topic
Dynamics and Control of Mechanical Systems
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Reaction uniqueness problem in the divide-and-conquer approach

Marek Wojtyra, Janusz Frączek, Marcin Pękal, Paweł Malczyk
Multibody System Dynamics
Dynamics and Control of Mechanical Systems
article

Reaction uniqueness problem in the divide-and-conquer approach

Marek Wojtyra, Janusz Frączek, Marcin Pękal, Paweł Malczyk
article en

Abstract

Abstract When overconstrained multibody mechanisms are modeled as rigid body systems, some or all of the reaction forces are non-unique, which may affect other simulation results, making them incorrect. Despite this global ambiguity, unambiguously determinable reactions may be present in the system. For some multibody formulations, methods for checking which reactions are unique and which are non-unique are available. This paper presents a new version of the reaction uniqueness analysis approach based on the divide-and-conquer algorithm. In this method, single- and multi-joint connections are treated in the same way, and the approach does not require additional passes along a binary tree. The uniqueness test may be performed by considering the coefficient matrix (in full or reduced form)—after the main pass of the DCA is finished—by using one of the following numerical methods: rank comparison, QR decomposition, SVD, or nullspace approaches. All of them are considered in this article. The new approach can be applied to a broader class of mechanisms than the DCA-based method developed so far. Moreover, more complex reaction sets may be considered. A spatial parallelogram mechanism with a triple pendulum is studied to illustrate the approach. Furthermore, the proposed method is compared with different approaches to uniqueness analysis in terms of computational efficiency.

Multibody System Dynamics
Warsaw University of Technology (PL)
Narodowym Centrum Nauki
Openalex Percentile: Top 58%
Dynamics and Control of Mechanical Systems
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.