Article | REF: AF5054 V1

Simulation of mechanisms - Solving equations using software

Author: Wilfrid MARQUIS-FAVRE

Publication date: July 10, 2007

You do not have access to this resource.
Click here to request your free trial access!

Already subscribed? Log in!


Overview

Français

ABSTRACT

This article is dedicated to the simulation of mechanisms and more specifically to solving of equations using software. A large number of integration methods of mathematical models upstream of modeling are available (such as the Euler, Runge-Kutta and Adams-Moulton methods). This is the reason why the general framework of differential equation systems and digital integration are studied in this article. The various solution methods are listed: coordinate partitioning, projection method, the Baumgarte stabilization, etc.

Read this article from a comprehensive knowledge base, updated and supplemented with articles reviewed by scientific committees.

Read the article

AUTHOR

 INTRODUCTION

coordination by Michel Fayet, Professor Emeritus at INSA Lyon

Here we are in the downstream modelling phase, which consists in numerically integrating the mathematical models previously obtained (see files ). There are numerous integration methods: Euler, Runge-Kutta, Adams-Bashforth, Adams-Moulton, Backward Differentiation Formula, Gear, to name but a few. Certainly the most crucial problem associated with mechanism simulation is that of numerically solving systems of algebraic-differential equations (ADEs). In this case, simulation can be undertaken at the cost of a "mathematical reformulation" of the problem. Techniques such as coordinate partitioning, the projection method, Baumgarte stabilization or the penalty method can be used. In addition, the transformation of certain numerical methods (from their explicit to their implicit form, not to be confused with the explicit and implicit forms given to the model in ), can also be used to simulate algebraic-differential systems (Runge-Kutta Implicit -IRK- method, for example).

Throughout this section, we assume that the mechanism has no hyperstatic unknowns or, in other words, that the C matrix for the first-order binding equations is of full rank. Furthermore, n represents the number of generalized coordinates and L the number of binding equations, as in previous sections.

You do not have access to this resource.

Exclusive to subscribers. 97% yet to be discovered!

You do not have access to this resource.
Click here to request your free trial access!

Already subscribed? Log in!


The Ultimate Scientific and Technical Reference

A Comprehensive Knowledge Base, with over 1,200 authors and 100 scientific advisors
+ More than 10,000 articles and 1,000 how-to sheets, over 800 new or updated articles every year
From design to prototyping, right through to industrialization, the reference for securing the development of your industrial projects

This article is included in

Physics and chemistry

This offer includes:

Knowledge Base

Updated and enriched with articles validated by our scientific committees

Services

A set of exclusive tools to complement the resources

Practical Path

Operational and didactic, to guarantee the acquisition of transversal skills

Doc & Quiz

Interactive articles with quizzes, for constructive reading

Subscribe now!

Ongoing reading
Mechanism simulation