## Computing an upper bound on contact stress with surrogate duality.(English)Zbl 1398.74425

Summary: We present a method for computing an upper bound on the contact stress of elastic bodies. The continuum model of elastic bodies with contact is first modeled as a constrained optimization problem by using finite elements. An explicit formulation of the total contact force, a fraction function with the numerator as a linear function and the denominator as a quadratic convex function, is derived with only the normalized nodal contact forces as the constrained variables in a standard simplex. Then two bounds are obtained for the sum of the nodal contact forces. The first is an explicit formulation of matrices of the finite element model, derived by maximizing the fraction function under the constraint that the sum of the normalized nodal contact forces is one. The second bound is solved by first maximizing the fraction function subject to the standard simplex and then using Dinkelbach’s algorithm for fractional programming to find the maximum – since the fraction function is pseudo concave in a neighborhood of the solution. These two bounds are solved with the problem dimensions being only the number of contact nodes or node pairs, which are much smaller than the dimension for the original problem, namely, the number of degrees of freedom. Next, a scheme for constructing an upper bound on the contact stress is proposed that uses the bounds on the sum of the nodal contact forces obtained on a fine finite element mesh and the nodal contact forces obtained on a coarse finite element mesh, which are problems that can be solved at a lower computational cost. Finally, the proposed method is verified through some examples concerning both frictionless and frictional contact to demonstrate the method’s feasibility, efficiency, and robustness.

### MSC:

 74S05 Finite element methods applied to problems in solid mechanics 65N30 Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs 65N15 Error bounds for boundary value problems involving PDEs 74M15 Contact in solid mechanics 74B05 Classical linear elasticity

### Keywords:

contact stress; upper bound; surrogate duality; finite elements

SimpleS
Full Text:

### References:

  Wriggers P (2006) Computational contact mechanics. Springer, New York · Zbl 1104.74002  Yastrebov VA (2013) Numerical methods in contact mechanics. Wiley-ISTE, London · Zbl 1268.74003  Stein E, Ramm E, Rank E, Rannacher R, Schweizerhof K, Stein E, Wendland W, Wittum G, Wriggers P, Wunderlich W (2003) Error-controlled adaptative finite elements in solid mechanics. Wiley, New York  Paraschivoiu, M; Peraire, J; Patera, AT, A posteriori finite element bounds for linear-functional outputs of elliptic partial differential equations, Comput Methods Appl Mech Eng, 150, 289-312, (1997) · Zbl 0907.65102  Prudhomme, S; Oden, JT, On goal-oriented error estimation for elliptic problems: application to the control of pointwise errors, Comput. Methods Appl. Mech. Eng., 176, 313-331, (1999) · Zbl 0945.65123  Ladevèze P, Pelle JP (2005) Mastering calculations in linear and nonlinear mechanics. Springer, New York · Zbl 1077.74001  Xuan, ZC; Parés, N; Peraire, J, Computing upper and lower bounds for the J-integral in two-dimensional linear elasticity, Comput Methods Appl Mech Eng, 195, 430-443, (2006) · Zbl 1193.74042  Parés, N; Bonet, J; Huerta, A; Peraire, J, The computation of bounds for linear-functional outputs of weak solutions to the two-dimensional elasticity equations, Comput Methods Appl Mech Eng, 195, 406-429, (2006) · Zbl 1193.74041  Parés N, Díez P, Huerta A (2013) Computable exact bounds for linear outputs from stabilized solutions of the advection-diffusion-reaction equation. Int J Numer Methods Eng 93:483-509 · Zbl 1230.65066  Ladevèze, P; Pled, F; Chamoin, L, New bounding techniques for goal-oriented error estimation applied to linear problems, Int J Numer Methods Eng, 93, 1345-1380, (2013) · Zbl 1352.74389  Liu, GR; Zhang, GY, Upper bound solution to elasticity problems: a unique property of the linearly conforming point interpolation method (LCPIM), Int J Numer Methods Eng, 74, 1128-1161, (2008) · Zbl 1158.74532  Xuan, ZC; Lassila, T; Rozza, G; Quarteroni, A, On computing upper and lower bounds on the outputs of linear elasticity problems approximated by the smoothed finite element method, Int J Numer Methods Eng, 83, 174-195, (2010) · Zbl 1193.74160  Jiang, J; Liu, GR; Zhang, YW; Chen, L; Tay, TE, A singular ES-FEM for plastic fracture mechanics, Comput Methods Appl Mech Eng, 200, 2943-2955, (2011) · Zbl 1230.74183  Liu, GR; Jiang, Y; Chen, L; Zhang, GY; Zhang, YW, A singular cell-based smoothed radial point interpolation method for fracture problems, Comput Struct, 89, 1378-1396, (2011)  Glover, F, Surrogate constraints, Oper Res, 16, 741-749, (1968) · Zbl 0165.22602  Greenberg, HJ; Pierskalla, WP, Surrogate mathematical programming, Oper Res, 18, 924-939, (1970) · Zbl 0232.90059  Xuan, ZC; Lee, KH, Interior point surrogate dual algorithm for unilateral problems, Acta Mech, 166, 149-167, (2003) · Zbl 1064.74136  Xuan, ZC; Lee, KH, Surrogate duality based method for contact problems, Optim Eng, 5, 59-75, (2004) · Zbl 1043.74035  Paulavičius R, Žilinskas J (2014) Simplicial global optimization. Springer, New York · Zbl 1401.90017  Edelsbrunner H, Grayson DR Edgewise subdivision of a simplex. In: Proceeding SCG ’99 proceedings of the fifteenth annual symposium on computational geometry, pp 24-30 · Zbl 0968.51016  Gonçalves, EN; Palhares, RM; Takahashi, RHC; Mesquita, RC, Algorithm 860: simples—an extension of freudenthals simplex subdivision, ACM Trans Math Softw, 32, 609-621, (2006) · Zbl 1230.65066  Dinkelbach, W, On nonlinear fractional programming, Manag Sci, 13, 492-498, (1967) · Zbl 0152.18402
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.