Residual-Based Newton Raphson Line Search Strategy

From KratosWiki
Jump to: navigation, search

Definition

Implicit solving strategy for Non-Linear analysis. It automatically executes the Line-Search when is needed.

Constructor Main Data

The usual common data is required in the constructor for the Newton Rapshon Strategy:

  1. Model Part
  2. Time Integration Scheme (Newmark, Bossak, ...)
  3. Convergence Criterion (Residual, Displacements, ...)
  4. Linear Solver (Direct, Iterative, ...)
  5. Builder and Solver
  6. Maximum Number of Iterations (default 30)
  7. Common Flags: (false by default)
    1. CalculateReactionFlag (compute reactions)
    2. ReformDofSetAtEachStep (check and change the dofs at each step)
    3. MoveMeshFlag (update the coordinates of the nodes at each step)


If the maximum number of iterations is reached, the last result is taken as converged and the analysis keeps on running. When this happens and the analysis does not crash, the accuracy of the results will be very low and we recommend to not trust it.

Personal tools
Categories