A State–Time Formulation for Dynamic Systems Simulation Using Massively Parallel Computing Resources

ISSN： 0924-090X

Source： Nonlinear Dynamics, Vol.39, Iss.3, 2005-02, pp. : 305-318

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

A novel state–time (ST) formulation for the simulation and analysis of the dynamic behavior of complex multibody systems is presented. The method proposes a computationally fast algorithm which is better able to fully exploit anticipated future immensely parallel computing resources (e.g. pecta flop machines and beyond) than existing multibody algorithms. The intent of the algorithm is to yield significantly reduced simulation turnaround time in situations where massively parallel (>10⁶ processors) computing resources are available to it. It is shown that as a consequence of such a ST discretization scheme, the system of governing equations yields a set of loosely coupled nonlinear algebraic equations which is at most quadratic in the ST variables, with significant linear components. As such, it is well-suited in structure for nonlinear algebraic equations solvers. The linear-quadratic (LQ) structure of these equations further permits the use of a special solution scheme, which is expected to yield superior performance relative to more traditional Newton–Raphson type schemes when applied to large general systems.