SOL 106 - How to understand convergence

[Gaetan82]

Good Morning,
I have a question: during a run 106 ( non linear static) a way to check if the run in going on is to open f06 and check the % of load applied: (like in this example = 30%)

$$$$
0 N O N - L I N E A R I T E R A T I O N M O D U L E O U T P U T

STIFFNESS UPDATE TIME 256.00 SECONDS SUBCASE 1
ITERATION TIME 5.29 SECONDS LOAD FACTOR 0.3000000

- - - CONVERGENCE FACTORS - - - - - - LINE SEARCH DATA - - -
0ITERATION EUI EPI EWI LAMBDA DLMAG FACTOR E-FIRST E-FINAL NQNV NLS ENIC NDV MDV

8 3.9096E-04 9.6233E-03 1.1602E-07 1.0000E-01 3.8261E-02 1.0000E+00 3.5570E-01 3.5570E-01 0 0 0 1
*** USER INFORMATION MESSAGE 6186 (NCONVG)
*** SOLUTION HAS CONVERGED ***
SUBID 1 LOOPID 6 LOAD STEP 0.300 LOAD FACTOR 0.30000000

*** NEW STIFFNESS MATRIX IS REQUIRED ***

but there are other informations ( in this convergence factors) or in other part of f06 (or f04) that can help me to understand if the run is going well or it will fail ?
Thank you Gaetan 82

 

[BlasMolero]

Hello!
The best method I use is to take a look to the NX Nasran Analysis Monitor when launching the nastran job from inside FEMAP, here I see how the solution progress, not need to take a look to *.F06 file:

The most crucial data for successful nonlinear static solutions are contained in the NLPARM bulk data entry. NLPARM defines strategies for the incremental and iterative solution processes. It is difficult to choose the optimal combination of all the options for a specific problem. However, based on a considerable number of numerical experiments, the default option was intended to provide the best workable method for a general class of problems. Therefore, if you have little insight or experience in a specific application, you should start with the default option. However, if you have some experience and insight in a specific problem, you can change the default values, if you keep in mind the following guidelines:

•Computing cost for each line search is comparable to that of an iteration.
•The SEMI method usually provides better convergence than the AUTO method at the expense of higher computing cost.
•Default tolerances for the convergence criteria may be somewhat conservative. However, loose tolerances may cause difficulties in the subsequent steps.
•The quasi-Newton method is effective in most problems. However, it seems to have adverse effects in some problems, e.g., creep analysis.
•The line search method is effective to cope with difficulties in convergence in some problems. More extensive line searches may be exercised by a large value of MAXLS and/or a smaller value of LSTOL. On the other hand, line searches may have adverse effects in some problems, e.g., plane stress plasticity.
•The arc-length method should be used if the problem involves snap-through or postbuckling deformation. Then the Bulk Data entry NLPCI must be attached.

At each iteration, the computing time for convergence without the stiffness matrix update is estimated and compared with the computing time for the matrix update in order to determine whether the update is more efficient. This decision is deferred in the first two iterations after a new stiffness is obtained. If the solution tends to diverge, however, the update decision will be made effective immediately. The stiffness matrix will be updated upon convergence if the number of iterations required for convergence is greater than KSTEP. The SEMI option is identical to the AUTO option except for one additional stiffness update after the first iteration which always occurs unless the solution converges in a single iteration. With the ITER option, the stiffness matrix is updated at every KSTEP iterations. Thus, the full Newton-Raphson iteration is exercised if KSTEP is 1. If KSTEP > MAXITER, the stiffness will never be updated.

The MAXITER field is an integer representing the number of iterations allowed for each load increment. If the number of iterations reaches MAXITER without convergence, the load increment is bisected and the analysis is repeated. If the load increment cannot be bisected (i.e., MAXBIS is reached or MAXBIS = 0) and MAXDIV is positive, the best attainable solution is computed and the analysis is continued to the next load increment. If MAXDIV is negative, the analysis is terminated.

NX Nastran performs the convergence test at every iteration with the criteria you specify in the CONV field. You can specify any combination of U (for displacement), P (for load), and W (for work). All the specified criteria must be satisfied to achieve convergence, except for an absolute convergence condition, under which the solution is converged regardless of criteria.

I hope the above helps you to understabd better how nonlinear solutions runs in NX NASTRAN.
Best regards,
Blas.

~~~~~~~~~~~~~~~~~~~~~~
Blas Molero Hidalgo
Ingeniero Industrial
Director

IBERISA
48011 BILBAO (SPAIN)
WEB:

http://www.iberisa.com

Blog de FEMAP & NX Nastran:

http://iberisa.wordpress.com/

 

[Gaetan82]

Thank you BlasMolero
for your answer but, usually, i work with Patran and not with Femap; I already knew most of the things you told me so kindly, but i was curious to understand the mean of the parameters that i wrote in my first post and if, someone of them, could help me to predict the success or less of the run; but really thank you , if a day I work with Femap , this post will be very usefull.

Gaetan 82

 

[hezhj2000]

The table you referred to actual has all the information. By comparing EUI, EPI and EWI with the values you defined in the NLPARM, you will know if it is converged or not.

EUI Normalized error in the displacement.
EPI Normalized error in the load vector.
EWI Normalized error in the energy.
LAMBDA Rate of convergence. Solution is diverging if it is > 1.0.
DLMAG Absolute norm of the load error vector.
FACTOR Scale factor for line search method.
E-First Initial error before line search begins.
E-FINAL Final error after line search terminates.
N-QNV Number of quasi-Newton correction vectors to be used in the current iteration.
N-LS Number of line searches performed.
ENIC Expected number of iterations for convergence.
NDV Number of occurrences of probable divergence during the iteration.
MDV Number of occurrences of bisection conditions due to excessive increments in stress and rotations.

 

[Gaetan82]

Thank you hezhj2000 for your informations, they are very usefull.