Modified Newton Algorithm: Difference between revisions
No edit summary |
No edit summary |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Line 1: | Line 1: | ||
{{CommandManualMenu}} | {{CommandManualMenu}} | ||
This command is used to construct a ModifiedNewton algorithm object, which uses the modified newton algorithm to solve the nonlinear residual equation. The command is of the following form: | This command is used to construct a ModifiedNewton algorithm object, which uses the modified newton-raphson algorithm to solve the nonlinear residual equation. The command is of the following form: | ||
{| | {| | ||
| style="background: | | style="background:lightgreen; color:black; width:800px" | '''algorithm ModifiedNewton <-initial> ''' | ||
|} | |} | ||
{| | {| | ||
| style="width:150px" | '''-initial''' || optional flag to indicate | | style="width:150px" | '''-initial''' || optional flag to indicate to use initial stiffness iterations. | ||
|} | |} | ||
| Line 18: | Line 18: | ||
---- | ---- | ||
| Line 28: | Line 23: | ||
THEORY: | THEORY: | ||
The theory for the ModifiedNewton method is similar to that for the Newton-Raphson method. The difference is that the tangent at the initial guess is used in the iterations, instead of the current tangent. The Modified Newmark method is thus an iterative method in which, starting at a good initial guess <math>U_0</math> we keep iterating until <math>\Delta U</math> is small enough using the following: | The theory for the ModifiedNewton method is similar to that for the [[Newton_Algorithm | Newton-Raphson method]]. The difference is that the tangent at the initial guess is used in the iterations, instead of the current tangent. The Modified Newmark method is thus an iterative method in which, starting at a good initial guess <math>U_0</math> we keep iterating until <math>\Delta U</math> is small enough using the following: | ||
:<math> \Delta U = - K_0^{-1}R(U_n),\!</math> | :<math> \Delta U = - K_0^{-1}R(U_n),\!</math> | ||
Latest revision as of 18:24, 17 May 2013
- Command_Manual
- Tcl Commands
- Modeling_Commands
- model
- uniaxialMaterial
- ndMaterial
- frictionModel
- section
- geometricTransf
- element
- node
- sp commands
- mp commands
- timeSeries
- pattern
- mass
- block commands
- region
- rayleigh
- Analysis Commands
- Output Commands
- Misc Commands
- DataBase Commands
This command is used to construct a ModifiedNewton algorithm object, which uses the modified newton-raphson algorithm to solve the nonlinear residual equation. The command is of the following form:
| algorithm ModifiedNewton <-initial> |
| -initial | optional flag to indicate to use initial stiffness iterations. |
NOTES:
THEORY:
The theory for the ModifiedNewton method is similar to that for the Newton-Raphson method. The difference is that the tangent at the initial guess is used in the iterations, instead of the current tangent. The Modified Newmark method is thus an iterative method in which, starting at a good initial guess <math>U_0</math> we keep iterating until <math>\Delta U</math> is small enough using the following:
- <math> \Delta U = - K_0^{-1}R(U_n),\!</math>
- <math> U_{n+1} = U_n + \Delta U\,\!</math>
where:
- <math>K_0 = \frac{\partial R(U_0)}{\partial U}\,\!</math>
The advantage of this method over the regular Newton method, is that the system Jacobian is formed only once at the start of the step and factored only once if a direct solver is used. The drawback of this method is that it requires more iterations than Newton's method.
note: when -initial flag is provided <math>K_0</math> is Jacobian from undeformed configuration.
Code Developed by: fmk