AbstractThe standard implementation of the penalty function approach for the treatment of general constraint conditions in discrete systems of equations often leads to computational difficulties as the penalty weights are increased to meet constraint satisfaction tolerances. A family of iterative procedures that converges to the constrained solution for fixed weights is presented. For a discrete mechanical system, these procedures can be physically interpreted as an equilibrium iteration resulting from the appearance of corrective force patterns at the nodes of ‘constraint members’ of constant stiffness. Three forms of the iteration algorithm are studied in detail. Convergence conditions are established and the computational error propagation behaviour of the three forms is analysed. The conclusions are verified by numerical experiments on a model problem. Finally, practical guidelines concerning the implementation of the corrective process in large‐scale finite element codes are offered.
Read full abstract