The R-linear convergence rate of an algorithm arising from the semi-smooth Newton method applied to 2D contact problems with friction
نویسندگان
چکیده
The goal is to analyze the semi-smooth Newton method applied to the solution of contact problems with friction in two space dimensions. The primal-dual algorithm for problems with the Tresca friction law is reformulated by eliminating primal variables. The resulting dual algorithm uses the conjugate gradient method for inexact solving of inner linear systems. The globally convergent algorithm based on computing a monotonously decreasing sequence is proposed and its R-linear convergence rate is proved. Numerical experiments illustrate the performance of different implementations including the Coulomb friction law.
منابع مشابه
Generalized Newton Methods for the 2d-signorini Contact Problem with Friction in Function Space
The 2D-Signorini contact problem with Tresca and Coulomb friction is discussed in infinitedimensional Hilbert spaces. First, the problem with given friction (Tresca friction) is considered. It leads to a constraint non-differentiable minimization problem. By means of the Fenchel duality theorem this problem can be transformed into a constrained minimization involving a smooth functional. A regu...
متن کاملSemi-smooth Newton methods for mixed FEM discretizations of higher-order for frictional, elasto-plastic two-body contact problems
In this acticle a semi-smooth Newton method for frictional two-body contact problems and a solution algorithm for the resulting sequence of linear systems is presented. It is based on a mixed variational formulation of the problem and a discretization by finite elements of higher-order. General friction laws depending on the normal stresses and elasto-plastic material behaviour with linear isot...
متن کاملOn non-unique solutions of contact problems with the Coulomb friction
Our contribution deals with contact problems of linear elasticity with the Coulomb friction in two space dimensions. The finite element approximation leads to an algebraic problem whose projective primaldual formulation is given as an equation described by a piecewise differentiable function. The solution can be computed iteratively by the semi-smooth Newton method [1]. However, there are known...
متن کاملModify the linear search formula in the BFGS method to achieve global convergence.
<span style="color: #333333; font-family: Calibri, sans-serif; font-size: 13.3333px; font-style: normal; font-variant-ligatures: normal; font-variant-caps: normal; font-weight: 400; letter-spacing: normal; orphans: 2; text-align: justify; text-indent: 0px; text-transform: none; white-space: normal; widows: 2; word-spacing: 0px; -webkit-text-stroke-width: 0px; background-color: #ffffff; text-dec...
متن کاملA Trust Region Algorithm for Solving Nonlinear Equations (RESEARCH NOTE)
This paper presents a practical and efficient method to solve large-scale nonlinear equations. The global convergence of this new trust region algorithm is verified. The algorithm is then used to solve the nonlinear equations arising in an Expanded Lagrangian Function (ELF). Numerical results for the implementation of some large-scale problems indicate that the algorithm is efficient for these ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Comp. Opt. and Appl.
دوره 61 شماره
صفحات -
تاریخ انتشار 2015