From Linear FEA to Newton-Raphson Method in
Nonlinear FEA
By Dr. Iman Salehinia, NIU, April 2025
Key Question
If F = Ka in FEA, then in nonlinear FEA using Newton-Raphson, where does the stiffness
matrix go? Does it still play a role?
Short Answer
Yes — the stiffness matrix still plays a key role in nonlinear FEA. It transforms into the
tangent stiffness matrix KT (a), which depends on the current displacement. Unlike the
constant stiffness matrix in linear FEA, the tangent stiffness matrix is updated at each
Newton-Raphson iteration.
Step 1: Linear FEA
In linear finite element analysis:
Fext = Ka
• Fext is the external force vector
• K is the global stiffness matrix (constant)
• a is the nodal displacement vector
The problem is solved directly:
a = K−1 Fext
Step 2: Nonlinear FEA
In nonlinear problems (due to material or geometric nonlinearity), the internal force becomes
a nonlinear function of displacement:
R(a) = Fext − Fint (a) = 0
1
We want to solve for a such that:
Fint (a) = Fext
Step 3: Newton-Raphson Method
We apply Newton-Raphson to solve R(a) = 0:
(i+1) ∂R
(i)
R(a ) ≈ R(a ) + ∆a(i) = 0
∂a
Rearranged:
(i)
KT ∆a(i) = Fext − Fint (a(i) ) = R(i)
Where:
• ∆a(i) = a(i+1) − a(i)
(i)
• KT = ∂Fint
∂a a(i)
is the tangent stiffness matrix
Update rule:
a(i+1) = a(i) + ∆a(i)
Final Newton-Raphson Formula
(i)
KT ∆a(i) = Fext − Fint (a(i) )
Nonlinear Spring Example
Consider a nonlinear spring with:
Fint (u) = ku + αu3
Given:
• k = 10 N/m, α = 1 N/m3
• Fext = 20 N
Goal: Solve
ku + αu3 = Fext
Newton-Raphson Setup
R(u) = Fext − (ku + αu3 )
dFint
KT (u) = = k + 3αu2
du
R(u(i) )
∆u(i) = , u(i+1) = u(i) + ∆u(i)
KT (u(i) )
2
Sample Iterations
Iteration u(i) Fint R KT ∆u Updated u
0 1.000 11.00 9.00 13.00 0.692 1.692
1 1.692 21.75 -1.75 18.59 -0.094 1.598
2 1.598 20.06 -0.06 17.66 -0.0034 1.5946
Converged solution:
u ≈ 1.5946 m
Conclusion
• In linear FEA: F = Ka with constant K
• In nonlinear FEA: Fint (a) is nonlinear; we use KT = ∂Fint
∂a
• The stiffness matrix evolves into a tangent stiffness matrix, which is critical for Newton-
Raphson iterations