TY - GEN

T1 - Generalization of the Divide-and-Conquer Algorithm for the uncertainty quantification of multibody systems

AU - Poursina, Mohammad

PY - 2015

Y1 - 2015

N2 - This paper presents the mathematical framework for the efficient construction of the equations of motion of complex multibody problems when uncertainty exists in the systems' parameters and/or inputs. Herein, uncertainty is prorogated through the system dynamics by using the method of polynomial chaos expansion (PCE). In this scheme, states of the system are projected onto the space of appropriate orthogonal base functions. Furthermore, the method of Divide-and-Conquer Algorithm (DCA) is extended to construct the equations of motion of the resulting non-deterministic system. In this scheme, the mathematical formulation to generate the projected handle equations of motion of the bodies and the projected constraint equations of the connecting joints are constructed in terms of the PCE. Finally, these projected equations are used to perform the assembly and disassembly passes to form and solve the equations of motion. The proposed method is highly parallelizable and scales down the computational complexity as a linear and logarithmic function of the state variables in serial and parallel implementations, respectively.

AB - This paper presents the mathematical framework for the efficient construction of the equations of motion of complex multibody problems when uncertainty exists in the systems' parameters and/or inputs. Herein, uncertainty is prorogated through the system dynamics by using the method of polynomial chaos expansion (PCE). In this scheme, states of the system are projected onto the space of appropriate orthogonal base functions. Furthermore, the method of Divide-and-Conquer Algorithm (DCA) is extended to construct the equations of motion of the resulting non-deterministic system. In this scheme, the mathematical formulation to generate the projected handle equations of motion of the bodies and the projected constraint equations of the connecting joints are constructed in terms of the PCE. Finally, these projected equations are used to perform the assembly and disassembly passes to form and solve the equations of motion. The proposed method is highly parallelizable and scales down the computational complexity as a linear and logarithmic function of the state variables in serial and parallel implementations, respectively.

KW - Divide-and-conquer algorithm

KW - Multibody dynamics

KW - Polynomial chaos expansion

KW - Uncertainty quantification

UR - http://www.scopus.com/inward/record.url?scp=84979519259&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84979519259&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:84979519259

T3 - Proceedings of the ECCOMAS Thematic Conference on Multibody Dynamics 2015, Multibody Dynamics 2015

SP - 196

EP - 207

BT - Proceedings of the ECCOMAS Thematic Conference on Multibody Dynamics 2015, Multibody Dynamics 2015

A2 - Font-Llagunes, Josep M.

PB - International Center for Numerical Methods in Engineering

T2 - 2015 ECCOMAS Thematic Conference on Multibody Dynamics, Multibody Dynamics 2015

Y2 - 29 June 2015 through 2 July 2015

ER -