Secant Newton Algorithm: Difference between revisions
Jump to navigation
Jump to search
(Created page with '{{CommandManualMenu}} This command is used to construct a SecantNewton algorithm object which uses the two-term update to accelerate the convergence of the modified newton metho...') |
No edit summary |
||
| Line 14: | Line 14: | ||
| '''$tangIncr''' || tangent to increment on, options are current, initial, noTangent. default is current | | '''$tangIncr''' || tangent to increment on, options are current, initial, noTangent. default is current | ||
|- | |- | ||
| '''$maxDim''' || max number of | | '''$maxDim''' || max number of iterations until the tangent is reformed and acceleration restarts (default = 3) | ||
|} | |} | ||
| Line 22: | Line 22: | ||
NOTES: | NOTES: | ||
The default "cut-out" values recommended by Crisfield (R1=3.5, R2=0.3) are used. | |||
---- | ---- | ||
Latest revision as of 18:04, 15 January 2014
- 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 SecantNewton algorithm object which uses the two-term update to accelerate the convergence of the modified newton method. The command is of the following form:
| algorithm SecantNewton <-iterate $tangIter> <-increment $tangIncr> <-maxDim $maxDim> |
| $tangIter | tangent to iterate on, options are current, initial, noTangent. default is current. |
| $tangIncr | tangent to increment on, options are current, initial, noTangent. default is current |
| $maxDim | max number of iterations until the tangent is reformed and acceleration restarts (default = 3) |
NOTES:
The default "cut-out" values recommended by Crisfield (R1=3.5, R2=0.3) are used.
REFERENCES:
Crisfield, M.A. "Non-linear Finite Element Analysis of Solids and Structures", Vol. 1, Wiley, 1991.
Code Developed by: Michael Scott, Oregon State University