Please use this identifier to cite or link to this item: https://hdl.handle.net/10316/4256
Title: Automatic correction of the time step in implicit simulations of the stamping process
Authors: Oliveira, M. C. 
Menezes, L. F. 
Keywords: Finite element analysis; Implicit algorithms; Contact with friction
Issue Date: 2004
Citation: Finite Elements in Analysis and Design. 40:13-14 (2004) 1995-2010
Abstract: A specific aspect of simulations of stamping processes is the numerical method adopted to include the non-linearities associated with the frictional contact problem in large deformation plasticity. In fact, convergence problems are frequently encountered, especially when using a quasi-static implicit algorithm. One way of increasing the numerical robustness of these algorithms is to adopt an augmented Lagrangian method to incorporate the problem of contact with friction. The resulting non-linear system can be solved by a Newton-Raphson type method, for which a trial solution must be given to start the iterative equilibrium loop. The quality of this trial solution is determinant for the convergence of the iterative process. An automatic control of the size of the time step can improve this trial solution. In this study, a new size control for the time step, imposing restrictions not only on the increments of the state variables but also on the increments of the contact forces, is proposed. An example of a bending test is used to analyse the influence of this new limitation on the overall convergence behaviour of the fully implicit code DD3IMP.
URI: https://hdl.handle.net/10316/4256
DOI: 10.1051/matecconf/20168007002
Rights: openAccess
Appears in Collections:FCTUC Eng.Mecânica - Artigos em Revistas Internacionais

Files in This Item:
File Description SizeFormat
filec95e3291995d4f0397aa3858b0d87eca.pdf584.14 kBAdobe PDFView/Open
Show full item record

Page view(s) 20

779
checked on Apr 16, 2024

Download(s)

258
checked on Apr 16, 2024

Google ScholarTM

Check

Altmetric

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.