# zbMATH — the first resource for mathematics

An algorithm for the matrix-free solution of quasistatic frictional contact problems. (English) Zbl 0948.74060
Summary: A contact enforcement algorithm has been developed for matrix-free quasistatic finite element techniques. Matrix-free (iterative) solution algorithms such as nonlinear conjugate gradients and dynamic relaxation are desirable for large solid mechanics applications where direct linear equation solving is prohibitively expensive, but in contrast to more traditional Newton-Raphson and quasi-Newton iteration strategies, the number of iterations required for convergence is typically of the same order as the number of degrees of freedom of the model. It is therefore crucial that each of these iterations be inexpensive to perform, which is of course the essence of a matrix free method.
In applying such methods to contact problems, we emphasize here two requirements: first, that the treatment of the contact should not make an average equilibrium iteration considerably more expensive; and second, that the contact constraints should be imposed in such a way that they do not introduce spurious energy that acts against the iterative solver. These practical concerns are utilized to develop an iterative technique for accurate constraint enforcement that is suitable for nonlinear conjugate gradient and dynamic relaxation iterative schemes.

##### MSC:
 74S05 Finite element methods applied to problems in solid mechanics 74M15 Contact in solid mechanics
ABAQUS/Standard
Full Text:
##### References:
 [1] and Contact Problems in Elasticity: A Study of Variational Inequalities and Finite Element Methods, SIAM, Philadelphia, 1988. [2] Heegaard, Int. J. Numer. Meth. Engng. 36 pp 569– (1993) [3] Wriggers, Comp. Struct. 37 pp 319– (1990) [4] Carpenter, Int. J. Numer. Meth. Engng. 32 pp 103– (1991) [5] and ?An augmented Lagrangian formulation for the finite element solution of contact problems?, NCEL Contract Report CR 86{$$\cdot$$}008, 1986. [6] Laursen, Int. J. Numer. Meth. Engng. 36 pp 3451– (1993) [7] Simo, Comp. Struct. 42 pp 97– (1992) [8] Zavarise, Int. J. Numer. Meth. Engng. 38 pp 2929– (1995) [9] Benson, Comp. Meth. Appl. Mech. Engng. 78 pp 141– (1990) [10] Belytschko, Int. J. Numer. Meth. Engng. 31 pp 547– (1991) [11] Malone, Int. J. Numer. Meth. Engng. 37 pp 559– (1994) [12] Barauskas, Int. J. Numer. Meth. Engng. 37 pp 323– (1994) [13] Hu, Comp. Struct. 63 pp 1053– (1997) [14] Dilintas, Comp. Struct. 29 pp 675– (1988) [15] Jeusette, Comp. Struct. 33 pp 31– (1989) [16] May, Comp. Struct. 12 pp 595– (1986) [17] Pang, Math. Programming 73 pp 199– (1996) [18] Trinkle, Z. Angew Math. Mech. 77 pp 267– (1997) [19] SANTOS: A Two-Dimensional Finite Element Program for the Quasistatic Large Deformation Inelastic Response of Solids, Report SAND90-0543, Sandia National Laboratories, Albuquerque, NM, 1990 [20] JAC3D?A Three-Dimensional Finite Element Computer Program for the Nonlinear Quasistatic Response of Solids with the Conjugate Gradient Method, Report SAND87-1305 UC-814, Sandia National Laboratories, Albuquerque, NM, 1993 [21] JAS3D?A Finite Element Computer Program, Report in preparation, Sandia National Laboratories, Albuquerque, NM, 1998 [22] An Introduction to the Conjugate Gradient Method Without the Agonizing Pain, Available by anonymous FTP to WARP.CS.CMU.EDU (IP address 128.2.209.103) under filename quake-papers/painless-conjugate-gradient.ps, Carnegie Mellon University, Pittsburgh, PA, 1994 [23] and ?Methodology for proving contact algorithms in structural analysis codes?, Proc.1988 Cube Symp., Sandia National Laboratories, Albuquerque, NM, 1988 [24] Munjiza, Engng. Comput. 12 pp 145– (1995) [25] ABAQUS/Standard User’s Manual, Vol.1, Version 5.7,Hibbitt, Karlsson & Sorenson, Inc., Pawtucket, RI 02860-4847
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.