Lagrange Multipliers: Difference between revisions

From OpenSeesWiki
Jump to navigation Jump to search
No edit summary
mNo edit summary
 
Line 1: Line 1:
{{CommandManualMenu}}
{{CommandManualMenu}}


This command is used to construct a LagrangeMultiplier constraint handler, which enforces the constraints by introducing lagrange multiplies to the system of equation. The following is the command to construct a plain constraint handler:
This command is used to construct a LagrangeMultiplier constraint handler, which enforces the constraints by introducing Lagrange multiplies to the system of equation. The following is the command to construct a plain constraint handler:




Line 21: Line 21:


NOTES:
NOTES:
* The lagrange multiplier method introduces new unknowns to the system of equations. The diagonal part of the system corresponding to these new unknowns is 0.0. This ensure that the system IS NOT symmetric positive definite.
* The Lagrange multiplier method introduces new unknowns to the system of equations. The diagonal part of the system corresponding to these new unknowns is 0.0. This ensure that the system IS NOT symmetric positive definite.


----
----

Latest revision as of 07:51, 9 June 2016




This command is used to construct a LagrangeMultiplier constraint handler, which enforces the constraints by introducing Lagrange multiplies to the system of equation. The following is the command to construct a plain constraint handler:


constraints Lagrange <$alphaS $alphaM >


$alphaS <math>\alpha_S</math> factor on singe points. optional, default = 1.0
$alphaM <math>\alpha_M</math> factor on multi-points, optional default = 1.0;

NOTES:

  • The Lagrange multiplier method introduces new unknowns to the system of equations. The diagonal part of the system corresponding to these new unknowns is 0.0. This ensure that the system IS NOT symmetric positive definite.

THEORY:



Code Developed by: fmk