When the tangent matrix is updated only once in a certain pre-specified number of iterations (to save computational time) while updating the residual vector during each iteration, the procedure is...

When the tangent matrix is updated only once in a certain pre-specified number of iterations (to save computational time) while updating the residual vector during each iteration, the procedure is known as the modified Newton’s method or the Newton–Raphson method. Generally, the Newton–Raphson iteration solution method takes more iterations to converge than the full Newton’s method, and it may even diverge for certain types of nonlinearity.