d9.05.01 Implementing STAT_NON_LINE and DYNA_NON_LINE

Summary:

Here we describe the computer implementation of the algorithm for solving nonlinear, nonlinear, and dynamic, nonlinear problems. The documents describing these algorithms in detail are supposed to be known ([R5.03.01] and [R5.05.05]), we will only recall the main steps. In this document, we will find a summary of the notations, the simplified flowchart of the op0070 routine, making it possible to discern the main logical joints of the operators STAT_NON_LINE and DYNA_NON_LINE of Code_Aster, the call tree, a description of computer objects and the main routines, and a few pitfalls to avoid during development in this operator.

Table of contents

• 1. Introduction
• 2. Data structures
  • 2.1. The types of SD
  • 2.2. Creating SDs
  • 2.3. Reading user data
  • 2.4. SD description
• 3. Algorithm Management
  • 3.1. The different loops
  • 3.2. State of the loops
  • 3.3. The events
  • 3.4. Event Management
• 4. General algorithm
  • 4.1. Global reads and initializations
  • 4.2. Completion of a time step
• 5. Construction and resolution of systems
  • 5.1. Systems to be solved
  • 5.2. The Merimo routine
  • 5.3. Calculating matrices
  • 5.4. Calculating the resulting matrix MATASS
  • 5.5. Calculation of the second limb
  • 5.6. System resolution