0% found this document useful (0 votes)
158 views55 pages

Chap 2 Nonlinear Finite Element Analysis Procedures: Nam-Ho Kim

This document discusses nonlinear finite element analysis procedures. It introduces various types of nonlinearity that can exist in structural problems, including geometric nonlinearity, material nonlinearity, kinematic nonlinearity, and force nonlinearity. Geometric nonlinearity refers to nonlinear relationships between displacement, strain, and rotation. Material nonlinearity considers nonlinear stress-strain behaviors. Kinematic nonlinearity involves non-constant displacement boundary conditions or contact. Force nonlinearity means loads that depend on deformation. The document contrasts linear and nonlinear problems, and categorizes nonlinear problems as having mild or rough nonlinearity depending on the complexity of relationships. It also outlines the goal of formulating and solving nonlinear finite element equations to satisfy equilibrium between internal and external forces.

Uploaded by

Sarah Crawford
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
158 views55 pages

Chap 2 Nonlinear Finite Element Analysis Procedures: Nam-Ho Kim

This document discusses nonlinear finite element analysis procedures. It introduces various types of nonlinearity that can exist in structural problems, including geometric nonlinearity, material nonlinearity, kinematic nonlinearity, and force nonlinearity. Geometric nonlinearity refers to nonlinear relationships between displacement, strain, and rotation. Material nonlinearity considers nonlinear stress-strain behaviors. Kinematic nonlinearity involves non-constant displacement boundary conditions or contact. Force nonlinearity means loads that depend on deformation. The document contrasts linear and nonlinear problems, and categorizes nonlinear problems as having mild or rough nonlinearity depending on the complexity of relationships. It also outlines the goal of formulating and solving nonlinear finite element equations to satisfy equilibrium between internal and external forces.

Uploaded by

Sarah Crawford
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 55

1

CHAP 2
Nonlinear Finite Element Analysis
Procedures

Nam-Ho Kim

1
Goals

• What is a nonlinear problem?

• How is a nonlinear problem different from a linear one?

• What types of nonlinearity exist?

• How to understand stresses and strains

• How to formulate nonlinear problems

• How to solve nonlinear problems

• When does nonlinear analysis experience difficulty?

2
Nonlinear Structural Problems
• What is a nonlinear structural problem?
– Everything except for linear structural problems
– Need to understand linear problems first

• What is linearity?

Input x y  ax Output y
(load, heat) (displ, temp)

x1 y1
x1 x2
x2 y2
y  ax
2x1 2y1 Y
2x1 +3x2 2y1+3y2

• Example: fatigue analysis


3
What is a linear structural problem?
Global Local Local Global
Linear Linear Linear
Force Stress Strain Displacement

A0 A  = E

F/2
L0 L
F/2 L
F F E
 ?  L L
A0 A(F)  ? ?
A0E L0 L
F  A0  A0E  L
L0
• Linearity is an approximation
• Assumptions:
– Infinitesimal strain (<0.2%)
– Infinitesimal displacement
– Small rotation
– Linear stress-strain relation 4
Observations in linear problems
• Which one will happen?
M M

• Will this happen?

F
Truss Truss

5
What types of nonlinearity
exist?

It is at every stage of analysis

6
Linear vs. Nonlinear Problems
• Linear Problem:
1  ui uj 
  
– Infinitesimal deformation: ij
 
2  xj xi 
– Linear stress-strain relation: σ  D : ε
Undeformed coord.
– Constant displacement BCs
Constant
– Constant applied forces

• Nonlinear Problem:
– Everything except for linear problems!

– Geometric nonlinearity: nonlinear strain-displacement relation

– Material nonlinearity: nonlinear constitutive relation

– Kinematic nonlinearity: Non-constant displacement BCs, contact

– Force nonlinearity: follow-up loads


7
Nonlinearities in Structural Problems

Displacement Strain Stress


Nonlinear Nonlinear
displacement-strain stress-strain

Nonlinear displ. BC Nonlinear force BC

Prescribed Applied
displacement force

• More than one nonlinearity can exist at the same time

8
Geometric Nonlinearity
• Relations among kinematic quantities (i.e., displacement,
rotation and strains) are nonlinear
8.

Tip displacement
C1 C2
6.

4.

2.
C3
C0 0.
0.0 0.2 0.4 0.6 0.8 1.0
Normalized couple

• Displacement-strain relation
– Linear: du
(x) 
dx
2
du 1  du 
– Nonlinear: E(x)   
dx 2  dx 

9
Geometric Nonlinearity cont.
• Displacement-strain relation0.35
0.30 E
– E has a higher-order term
0.25

– (du/dx) << 1  (x) ~ E(x). 0.20


e

Strain
0.15

0.10

• Domain of integration 0.05

– Undeformed domain W0 0
0 0.05 0.10 0.15 0.20 0.25 0.30
du/dx
– Deformed domain Wx

a( u, u )  W (u ) : (u) dW

Deformed domain is unknown

10
Material Nonlinearity
• Linear (elastic) material
{  }  [D]{  }
– Only for infinitesimal deformation

• Nonlinear (elastic) material More generally, {} = {f()}


– [C] is not a constant but depends on deformation
dU
– Stress by differentiating strain energy density U 
– Linear material: d
1 dU
U E2   E
2 d
– Stress is a function of strain (deformation): potential, path
independent

Nonlinear
E spring

1 
E Linear spring

Linear and nonlinear elastic spring models
11
Material Nonlinearity cont.
• Elasto-plastic material (energy dissipation occurs)
– Friction plate only support stress up to y
– Stress cannot be determined from stress alone
– History of loading path is required: path-dependent

E Y

Y E

Elasto-plastic spring model

• Visco-elastic material
– Time-dependent behavior
– Creep, relaxation
h 
E E

time
Visco-elastic spring model
12
Boundary and Force Nonlinearities
• Nonlinear displacement BC (kinematic nonlinearity)
– Contact problems, displacement dependent conditions

max

Force
Displacement
Contact boundary

• Nonlinear force BC (Kinetic nonlinearity)

13
Mild vs. Rough Nonlinearity

• Mild Nonlinear Problems


– Continuous, history-independent nonlinear relations between
stress and strain

– Nonlinear elasticity, Geometric nonlinearity, and deformation-


dependent loads

• Rough Nonlinear Problems


– Equality and/or inequality constraints in constitutive relations

– History-dependent nonlinear relations between stress and strain

– Elastoplasticity and contact problems

14
Nonlinear Finite Element Equations
• Equilibrium between internal and external forces
Linear problems
P(d)  F(d) [K]{ d}  {F}

Stress Loads
Strain

• Kinetic and kinematic nonlinearities


– Appears on the boundary
– Handled by displacements and forces (global, explicit)
– Relatively easy to understand (Not easy to implement though)
• Material & geometric nonlinearities
– Appears in the domain
– Depends on stresses and strains (local, implicit)

15
Solution Procedure

We can only solve for linear problems …

16
Example – Nonlinear Springs
• Spring constants k1 k2

– k1 = 50 + 500u F
u1 u2
k2 = 100 + 200u

• Governing equation
 300u12  400u1u2  200u22  150u1  100u2  0 P1

 200u12  400u1u2  200u22  100u1  100u2  100 P2

– Solution is intersection between two zero contours


– Multiple solutions may exist
– No solution exists in a certain situation

17
Solution Procedure
• Linear Problems
Kd  F or P(d)  F
2F
– Stiffness matrix K is constant
K
F
P(d1  d2 )  P(d1 )  P(d2 )
P(d)  P(d)  F d 2d
– If the load is doubled, displacement is doubled, too

– Superposition is possible

• Nonlinear Problems
P(d)  F, P(2d)  2F F

– How to find d for a given F? KT

Incremental Solution Procedure di d


18
Newton-Raphson Method
• Most popular method
• Assume di at i-th iteration is known
• Looking for di+1 from first-order Taylor series expansion

P(di1 )  P(di )  KTi (di )  di  F


i
i i  P 
– KT (d )    : Jacobian matrix or Tangent stiffness matrix
 d 

• Solve for incremental solution


KTi di  F  P(di )
F P(d)
KTi 1
• Update solution KTi Solution
P(di+1)
di1  di  di
P(di) di+1
di di+1 di+2 dn d 19
N-R Method cont.
• Observations:
– Second-order convergence near the solution (Fastest method!)
uexact  un 1
lim c
– Tangent stiffness KTi (di ) is not constant n 
uexact  un
2

– The matrix equation solves for incremental displacement di

– RHS is not a force but a residual force Ri  F  P(di )

– Iteration stops when conv < tolerance

n n
 j 1
(Ri 1 2
j )
Or,
 j 1
( ui 1 2
j )
conv  n
conv  n
1 (F
j 1 j
)2
1   j1 ( uj0 )2

20
N-R Algorithm
1. Set tolerance = 0.001, k = 0, max_iter = 20, and initial
estimate u = u0
2. Calculate residual R = f – P(u)
3. Calculate conv. If conv < tolerance, stop
4. If k > max_iter, stop with error message
5. Calculate Jacobian matrix KT
6. If the determinant of KT is zero, stop with error message
7. Calculate solution increment u
8. Update solution by u = u + u
9. Set k = k + 1
10. Go to Step 2
21
Example – N-R Method
 d1  d2   3  0 1  0 6 
P(d)   2  F d   P( d )   
2
 d1  d2   9  5   26 

P  1 1  0 0 3 
KT   R  F  P(d )   
d  2d1 2d2   17 
• Iteration 1

 1 1   d10   3   d10   1.625 


 2 10   0    17   0 
1.375

   d2     d2   

1 0  0.625 
0
d  d  d   
 3.625 

 0 
R1  F  P(d1 )   
 4.531 
22
Example – N-R Method cont.
• Iteration 2
 1 1   d11   0   d11   0.533 
 1.25 7.25   1    4.531   1  
   d2     d2   0.533 

 0.092  2 2  0 
2 1 1
d  d  d    R  F  P( d )   
 3.092   0.568 

• Iteration 3

 1 1   d12   0   d12   0.089 


 0.184 6.184   2    0.568   2   
   d2     d2   0.089 

3 2 2 0.003   0 
d  d  d    R3  F  P(d3 )   
 3.003   0.016 

23
Example – N-R Method cont.
• Iteration 4
 1 1   d13   0   d13   0.003 
 0.005 6.005   3    0.016   3   
   d2     d2   0.003 

 0.000  4 4 0 
4 3
d  d  d   3
 R  F  P( d )   
 3.000  0 
Residual
20
Iter ||R||
16
0 17.263
12

8
1 4.531

4 2 0.016
0 3 0.0
0 1 2 3 4

Iteration Quadratic convergence


24
When N-R Method Does Not Converge
• Difficulties
– Convergence is not always guaranteed

– Automatic load step control and/or line search techniques are


often used

– Difficult/expensive to calculate KTi (di )

Solution P(d)
P
d
F
P
d

di+2 di dn di+1 d

25
When N-R Method Does Not Converge cont.
• Convergence difficulty occurs when
– Jacobian matrix is not positive-definite

P.D. Jacobian: in order to increase displ., force must be increased

– Bifurcation & snap-through requires a special algorithm

F FC C
B A
FB B D

Force
C D
A
E
E
Displacement
26
Modified N-R Method
• Constructing KTi (di ) and solving KTi di  Ri is expensive

• Computational Costs (Let the matrix size be N x N)


– L-U factorization ~ N3

– Forward/backward substitution ~ N

• Use L-U factorized KTi (di ) repeatedly

• More iteration is required, but


F P(d)
each iteration is fast
P Solution
• More stable than N-R method d

• Hybrid N-R method


di di+1 dn d
27
Example – Modified N-R Method
• Solve the same problem using modified N-R method
 d  d2   3  1  6 
P(d)   21 2
 F d0    P( d 0 )   
 d1  d2   9  5   26 

P  1 1   3 
KT   R0  F  P(d0 )   
d  2d1 2d2   17 
• Iteration 1

 1 1   d10   3   d10   1.625 


 2 10   0    17   0 
1.375

   d2     d2   

 0.625  1 1  0 
1 0 0
d  d  d    R  F  P( d )   
 3.625   4.531 

28
Example – Modified N-R Method cont.
• Iteration 2
 1 1   d11   0   d11   0.566 
 2 10   1    4.531   1  
   d2     d2   0.566 

 0.059  2  0 
2
2 1
d  d  d   1
 R  F  P( d )   
 3.059   0.358 
Residual Iter ||R||
20
0 17.263
16
1 4.5310
12 2 0.3584
8 3 0.0831

4
4 0.0204
5 0.0051
0
0 1 2 3 4 5 6 7 6 0.0013
Iteration 7 0.0003
29
Incremental Secant Method
• Secant matrix
– Instead of using tangent stiffness, approximate it using the
solution from the previous iteration

– At i-th iteration F P(d)

Ksi di  F  P(di ) P


Solution
x

– The secant matrix satisfies


Secant
Ksi i i 1 i i 1
 (d  d )  P(d )  P(d ) stiffness
d0 d1 d2 d 3 dn d
– Not a unique process in high dimension

• Start from initial KT matrix, iteratively update it


– Rank-1 or rank-2 update

– The textbook has Broyden’s algorithm (Rank-1 update)

– Here we will discuss BFGS method (Rank-2 update_ 30


Incremental Secant Method cont.
• BFGS (Broyden, Fletcher, Goldfarb and Shanno) method
– Stiffness matrix must be symmetric and positive-definite

di  [Ksi ]1 {F  P(di )}  [Hsi ]{F  P(di )}

– Instead of updating K, update H (saving computational time)

Hsi  (I  wiviT )Hsi1 (I  wiviT )

i i 1  ( di1 )T (Ri1  Ri )  i
v R 1    R
 ( di )T Ri1 

i di1
w 
( di1 )T (Ri1  Ri )

• Become unstable when the No. of iterations is increased


31
Incremental Force Method
• N-R method converges fast if the initial estimate is close
to the solution
• Solid mechanics: initial estimate = undeformed shape
• Convergence difficulty
occurs when the applied
load is large
(deformation is large)
• IFM: apply loads in
increments. Use the
solution from the
previous increment
as an initial estimate
• Commercial programs
call it “Load Increment”
or “Time Increment” 32
Incremental Force Method cont.
• Load increment does not have to be uniform
– Critical part has smaller increment size
• Solutions in the intermediate load increments
– History of the response can provide insight into the problem
– Estimating the bifurcation point or the critical load
– Load increments greatly affect the accuracy in path-dependent
problems

33
Load Increment in Commercial Software
• Use “Time” to represent load level
– In a static problem, “Time” means a pseudo-time
– Required Starting time, (Tstart), Ending time (Tend) and increment
– Load is gradually increased from zero at Tstart and full load at Tend
– Load magnitude at load increment Tn:

T n  Tstart
n
F  F T n  n  T  Tend
Tend  Tstart

• Automatic time stepping


– Increase/decrease next load increment based on the number of
convergence iteration at the current load
– User provide initial load increment, minimum increment, and
maximum increment
– Bisection of load increment when not converged
34
Force Control vs. Displacement Control
• Force control: gradually increase applied forces and find
equilibrium configuration
• Displ. control: gradually increase prescribed displacements
– Applied load can be calculated as a reaction
– More stable than force control.
– Useful for softening, contact, snap-through, etc.

F F
P(u)
Fn
FC
P(u)
F3 FB
F2
F1 FA
u u
u1 u2 u3 un uA uB uC uD
35
Nonlinear Solution Steps

1. Initialization: d0  0; i  0

2. Residual Calculation Ri  F  P(di )

3. Convergence Check (If converged, stop)

4. Linearization
– Calculate tangent stiffness KTi (di )

5. Incremental Solution:
– Solve KTi (di )di  Ri

6. State Determination
di 1  di  di
– Update displacement and stress
i 1  i  i
7. Go To Step 2
36
Nonlinear Solution Steps cont.
• State determination
– For a given displ dk, determine current state (strain, stress, etc)

uk ( x)  N( x)  dk k  B  dk k  f(k )

– Sometimes, stress cannot be determined using strain alone

• Residual calculation
– Nodal forces due to internal stresses = -applied nodal forces

Rk   NT t d   NT fb dW   BT k dW


s W W

37
Example – Linear Elastic Material
• Governing equation (Scalar equation)
u  Nd
W ( u )T  dW   u T t d   u T fb dW
s W ( u )  B  d

• Collect d
dT   B  dW  
W
T
s
NT t d  W N T fb d W 
P ( d) F

• Residual R  F  P(d)
F
• Linear elastic material
  D  DBd KT
P(d)
KT   W BT DB dW
d d 38
Example – Nonlinear Bar

• Rubber bar   E tan 1 (m)  d1 


d  
T L T  d2 
• Discrete weak form d  B Adx  d TF
0
R 
L A F 
• Scalar equation R F dx F 
L
0

 R  F  (d)A 1
B   1 1 
L
120

100

80

1 2 F = 10kN Stress
60

x 40
L = 1m 20

0
0 0.01 0.02 0.03 0.04 0.05
Strain
39
Example – Nonlinear Bar cont.

• Jacobian
dP d(d) d d 1 
 A A  mAE cos2  
dd dd d dd L E
• N-R equation
1 k
2    k k
 mAE cos    d  F   A
L  E 
• Iteration 1 d1  d0  d0  0.025m
mAE 0 1  d1 / L  0.025
d  F
L
1  E tan 1 (m1 )  78.5MPa
• Iteration 2
 mAE 1
2    1 1 d2  d1  d1  0.0357m
 cos    d  F   A
 L  E  2  d2 / L  0.0357
2  E tan 1 (m2 )  96MPa
40
N-R or Modified N-R?
• It is always recommended to use the Incremental Force Method
– Mild nonlinear: ~10 increments
– Rough nonlinear: 20 ~ 100 increments
– For rough nonlinear problems, analysis results depends on increment size

• Within an increment, N-R or modified N-R can be used


– N-R method calculates KT at every iteration
– Modified N-R method calculates KT once at every increment
– N-R is better when: mild nonlinear problem, tight convergence criterion
– Modified N-R is better when: computation is expensive, small increment
size, and when N-R does not converge well

• Many FE programs provide automatic stiffness update option


– Depending on convergence criteria used, material status change, etc

41
Accuracy vs. Convergence
• Nonlinear solution procedure requires
– Internal force P(d)
P
– Tangent stiffness KT (d) 
d
– They are often implemented in the same routine

• Internal force P(d) needs to be accurate


– We solve equilibrium of P(d) = F

• Tangent stiffness KT(d) contributes to convergence


– Accurate KT(d) provides quadratic convergence near the solution
– Approximate KT(d) requires more iteration to converge
– Wrong KT(d) causes lack of convergence

42
Convergence Criteria
• Most analysis programs provide three convergence criteria
– Work, displacement, load (residual)
– Work = displacement * load
– At least two criteria needs to be converged

• Traditional convergence criterion is load (residual)


– Equilibrium between internal and external forces P(d)  F(d)

• Use displacement criterion for load insensitive system

Force Use load


criterion

Use displacement
criterion

Displacement 43
Solution Strategies
• Load Step (subcase or step)
– Load step is a set of loading and boundary conditions to define an
analysis problem
– Multiple load steps can be used to define a sequence of loading
conditions

Load
LS1 LS2 Time

NASTRAN
SPC = 1
SUBCASE 1
LOAD = 1
SUBCASE 2
LOAD = 2
44
Solution Strategies
• Load Increment (substeps)
300

250 Loading
– Linear analysis concerns max load 200

150
– Nonlinear analysis depends on

Force
100
load path (history) 50

– Applied load is gradually increased 0

within a load step -50


Unloading
-100
– Follow load path, improve accuracy, 0 0.2 0.4 0.6
Displacement
0.8 1

and easy to converge

• Convergence Iteration F

– Within a load increment, an iterative Fa 5


method (e.g., NR method) is used to 34
2
find nonlinear solution
1
– Bisection, linear search, stabilization, etc
u

45
Solution Strategies cont.
• Automatic (Variable) Load Increment
– Also called Automatic Time Stepping
– Load increment may not be uniform
– When convergence iteration diverges, the load increment is halved
– If a solution converges in less than 4 iterations, increase time
increment by 25%
– If a solution converges in more than 8 iterations, decrease time
increment by 25%
• Subincrement (or bisection)
– When iterations do not converge at a given increment, analysis
goes back to previously converged increment and the load
increment is reduced by half
– This process is repeated until max number of subincrements

46
When nonlinear analysis does not converge
• NR method assumes a constant curvature locally
• When a sign of curvature changes around the solution, NR
method oscillates or diverges
• Often the residual changes sign between iterations
• Line search can help to converge

P (u )  u  tan 1 (5u )
dP
 1  5cos2 (tan 1 (5u ))
du
47
When nonlinear analysis does not converge

• Displacement-controlled vs. force-controlled procedure


– Almost all linear problems are force-controlled

– Displacement-controlled procedure is more stable for nonlinear


analysis

– Use reaction forces to calculate applied forces

F FC C
B A
FB B D

C D Force
A
E
E
Displacement

48
When nonlinear analysis does not converge
• Mesh distortion
– Most FE programs stop analysis when mesh is distorted too much
– Initial good mesh may be distorted during a large deformation
– Many FE programs provide remeshing capability, but it is still
inaccurate or inconvenient
– It is best to make mesh in such a way that the mesh quality can be
maintained after deformation (need experience)

Initial mesh
49
MATLAB Code for Nonlinear
FEA

50
NLFEA.m
• Nonlinear finite element analysis program
– Incremental force method with N-R method
– Bisection method when N-R failed to converge
– Can solve for linear elastic, hyperelastic and elasto-plastic material
nonlinearities with large deformation

• Global arrays
Name Dimension Contents
GKF NEQ x NEQ Tangent matrix
FORCE NEQ x 1 Residual vector
DISPTD NEQ x 1 Displacement vector
DISPDD NEQ x 1 Displacement increment
SIGMA 6 x 8 x NE Stress at each integration point
XQ 7 x 8 x NE History variable at each integration point

51
Input data

Update history variables

Print stress & displacement

T = T + T

Bisection control

Yes
Final time? Stop

No
Increase load & BC

T = T – T ITER = 0
T = T/2
Calculate R & K

Displacement BC

Converged? Yes

No
Yes Max ITER?
ITER=ITER + 1
No
Solve U = K\R

U = U + U
52
NLFEA.m cont
• Nodal coordinates and element connectivity
– the node numbers are in sequence
– nodal coordinates in XYZ(NNODE , 3)
– eight-node hexahedral elements LE(NELEN, 8)
• Applied forces and prescribed displacements
– EXTFORCE(NFORCE, 3): [node, DOF, value] format
– SDISPT(NDISPT, 3)

• Load steps and increments


– TIMS(NTIME,5): [Tstart, Tend, Tinc, LOADinit, LOADfinal] format

• Material properties
– Mooney-Rivlin hyperelasticity (MID = -1), PROP = [A10, A01, K]
– infinitesimal elastoplasticity (MID = 1), PROP = [LAMBDA, MU,
BETA, H, Y0]

53
NLFEA.m cont.
• Control parameters
– ITRA: maximum number of convergence iterations
– if residual > ATOL, then solution diverges, bisection starts
– The total number of bisections is limited by NTOL
– The convergence iteration converges when residual < TOL
– Program prints out results to NOUT after convergence

function NLFEA(ITRA,TOL,ATOL,NTOL,TIMS,NOUT,MID,PROP,EXTFORCE,SDISPT,XYZ,LE)
%***********************************************************************
% MAIN PROGRAM FOR HYPERELASTIC/ELASTOPLASTIC ANALYSIS
%***********************************************************************

54
Extension of a Single Element Example
%
% Nodal coordinates
XYZ=[0 0 0;1 0 0;1 1 0;0 1 0;0 0 1;1 0 1;1 1 1;0 1 1];
%
% Element connectivity
LE=[1 2 3 4 5 6 7 8];
%
% External forces [Node, DOF, Value]
EXTFORCE=[5 3 10.0; 6 3 10.0; 7 3 10.0; 8 3 10.0];
%
% Prescribed displacements [Node, DOF, Value]
SDISPT=[1 1 0;1 2 0;1 3 0;2 2 0;2 3 0;3 3 0;4 1 0;4 3 0];
%
% Load increments [Start End Increment InitialLoad FinalLoad]
TIMS=[0.0 0.5 0.1 0.0 0.5; 0.5 1.0 0.1 0.5 1.0]';
%
% Material properties
%PROP=[LAMBDA MU BETA H Y0]
MID=1;
PROP=[110.747, 80.1938, 0.0, 5., 35.0];
%
% Set program parameters
ITRA=20; ATOL=1.0E5; NTOL=5; TOL=1E-6;
%
% Calling main function
NOUT = fopen('output.txt','w');
NLFEA(ITRA, TOL, ATOL, NTOL, TIMS, NOUT, MID, PROP, EXTFORCE, SDISPT, XYZ, LE);
fclose(NOUT);
55

You might also like