TY - JOUR
T1 - Generalized co‐ordinate partitioning in static equilibrium analysis of large‐scale mechanical systems
AU - Nikravesh, Parviz E.
AU - Srinivasan, Manohar
PY - 1985/3
Y1 - 1985/3
N2 - This paper presents a computer‐based method for automatic formulation and efficient numerical solution of static equilibrium equations for nonlinear constrained mechanical systems with conservative forces. Nonlinear holonomic constraint equations and a potential energy function are written in terms of a maximal set of Cartesian generalized co‐ordinates. A stable static equilibrium configuration is found by minimizing the potential energy of the system, subject to the kinematic constraint equations, i.e. constrained optimization. A Gaussian elimination algorithm with full pivoting decomposes the constraint Jacobian matrix, identifies dependent and independent co‐ordinates and construct an influence coefficient matrix that relates variations in dependent and independent co‐ordinates. This information is employed to convert the constrained optimization problem to an unconstrained optimization problem. A simple example is presented to illustrate the method. An algorithm that may be used in analysis of large‐scale systems is presented.
AB - This paper presents a computer‐based method for automatic formulation and efficient numerical solution of static equilibrium equations for nonlinear constrained mechanical systems with conservative forces. Nonlinear holonomic constraint equations and a potential energy function are written in terms of a maximal set of Cartesian generalized co‐ordinates. A stable static equilibrium configuration is found by minimizing the potential energy of the system, subject to the kinematic constraint equations, i.e. constrained optimization. A Gaussian elimination algorithm with full pivoting decomposes the constraint Jacobian matrix, identifies dependent and independent co‐ordinates and construct an influence coefficient matrix that relates variations in dependent and independent co‐ordinates. This information is employed to convert the constrained optimization problem to an unconstrained optimization problem. A simple example is presented to illustrate the method. An algorithm that may be used in analysis of large‐scale systems is presented.
UR - http://www.scopus.com/inward/record.url?scp=0022029306&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0022029306&partnerID=8YFLogxK
U2 - 10.1002/nme.1620210306
DO - 10.1002/nme.1620210306
M3 - Article
AN - SCOPUS:0022029306
SN - 0029-5981
VL - 21
SP - 451
EP - 464
JO - International Journal for Numerical Methods in Engineering
JF - International Journal for Numerical Methods in Engineering
IS - 3
ER -