Algorithms for the analysis of 3D finite strain contact problems

Areias, P.; Sá, J. M. A. César de; Curnis, Antonio

doi:10.1002/nme.1104

Cited by 16 publications

(12 citation statements)

References 65 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Early implementations are reported in Hughes et al [1,2], Hallquist [3], and have been extended to more general cases in Bathe and Chaudhary 380 G. ZAVARISE AND L. DE LORENZIS [4], Hallquist et al [5], Wriggers and Simo [6], Wriggers et al [7], Papadopoulos et al [8], Stupkiewicz [9], Areias et al [10], see also Wriggers and Zavarise [11]. The non-penetration conditions are enforced by preventing the nodes on one contact surface (the 'slave' one) from penetrating the contact segments on the counterpart contact surface (the 'master' one).…”

Section: Introductionmentioning

confidence: 98%

A modified node‐to‐segment algorithm passing the contact patch test

Zavarise

Lorenzis

2009

Numerical Meth Engineering

View full text Add to dashboard Cite

SUMMARYSeveral investigations have shown that the classical one-pass node-to-segment (NTS) algorithms for the enforcement of contact constraints fail the contact patch test. This implies that the algorithms may introduce solution errors at the contacting surfaces, and these errors do not necessarily decrease with mesh refinement. The previous research has mainly focused on the Lagrange multiplier method to exactly enforce the contact geometry conditions. The situation is even worse with the penalty method, due to its inherent approximation that yields a solution affected by a non-zero penetration. The aim of this study is to analyze and improve the contact patch test behavior of the one-pass NTS algorithm used in conjunction with the penalty method for 2D frictionless contact. The paper deals with the case of linear elements. For this purpose, several sequential modifications of the basic formulation have been considered, which yield incremental improvements in results of the contact patch test. The final proposed formulation is a modified one-pass NTS algorithm which is able to pass the contact patch test also if used in conjunction with the penalty method. In other words, this algorithm is able to correctly reproduce the transfer of a constant contact pressure with a constant proportional penetration.

show abstract

Section: Introductionmentioning

confidence: 98%

A modified node‐to‐segment algorithm passing the contact patch test

Zavarise

Lorenzis

2009

Numerical Meth Engineering

View full text Add to dashboard Cite

show abstract

“…The example has been first proposed by Oden and Pire [46] as a 2D example, whereas more recent solutions can be found in Armero and Petocz [3], Areias et al [2], Cavalieri and Cardona [9] using a node-to-segment approach, and in the work of Fischer and Wriggers [18] using a 2D mortar approach. In this work, three-dimensional solutions have been computed introducing boundary conditions that match plane strain conditions to reproduce the same results as in Armero and Petocz [3].…”

Section: Validation Example I Friction Testmentioning

confidence: 99%

Numerical solution of frictional contact problems based on a mortar algorithm with an augmented Lagrangian technique

Cavalieri

Cardona

2015

Multibody Syst Dyn

View full text Add to dashboard Cite

This work presents a frictional contact formulation to solve three-dimensional contact problems with large finite displacements. The kinematic description of the contacting bodies is defined by using a mortar approach. The regularization of the variational frictional contact problem is solved with a mixed dual penalty approach based on an augmented Lagrangian technique. In this method, the numerical results do not depend on the definition of any user-defined penalty parameter affecting the normal or tangential component of forces. The robustness and performance of the proposed algorithm are studied and validated by solving a series of numerical examples with finite displacements and large slip.

show abstract

“…where n is the normal vector to the contact surface and σ is the local stress tensor [127]. However, the tensor σ is known in each integration point of the element.…”

Section: Implementation In Dd3imp Codementioning

confidence: 99%

Algorithms and Strategies for Treatment of Large Deformation Frictional Contact in the Numerical Simulation of Deep Drawing Process

Oliveira

Alves

Menezes

2008

Arch Computat Methods Eng

118

View full text Add to dashboard Cite

This paper describes a fully implicit algorithm developed and optimized to simulate sheet metal forming processes. This algorithm was implemented in the inhouse code DD3IMP. Attention is paid to the augmented lagrangian method adopted to treat the contact with friction problem. The global resolution of the coupled equilibrium and contact problem is performed in a single loop, with a static implicit iterative Newton-Raphson scheme. This demands particular attention in the contact search algorithm, which in this case adopts a parametric description of the tools. In order to highlight the adopted strategies a review of the state-of-the-art in sheet metal forming simulation is presented, with respect to models reliability and efficiency.

show abstract

Algorithms for the analysis of 3D finite strain contact problems

Cited by 16 publications

References 65 publications

A modified node‐to‐segment algorithm passing the contact patch test

A modified node‐to‐segment algorithm passing the contact patch test

Numerical solution of frictional contact problems based on a mortar algorithm with an augmented Lagrangian technique

Algorithms and Strategies for Treatment of Large Deformation Frictional Contact in the Numerical Simulation of Deep Drawing Process

Contact Info

Product

Resources

About