Efficient Algorithms for Problems with Friction

نویسندگان

  • Stefan Hüeber
  • Alina Matei
  • Barbara I. Wohlmuth
چکیده

Abstract. In this paper, a nonconforming discretization method for the frictional contact between two bodies subjected to antiplane shear deformation is considered. The method is based on a mixed variational formulation where for the discretization of the Lagrange multiplier dual basis functions are used. Under some regularity assumptions on the solution, an optimal a priori error estimate is obtained. To solve the discrete nonlinear problem an inexact primal-dual active set strategy is introduced. Finally, numerical examples confirming the theoretical result for the a priori error estimate and illustrating the performance of the algorithm are presented. The results can easily be generalized to the case of Coulomb friction, and a numerical example is given.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Primal-dual path-following algorithms for circular programming

Circular programming problems are a new class of convex optimization problems that include second-order cone programming problems as a special case. Alizadeh and Goldfarb [Math. Program. Ser. A 95 (2003) 3-51] introduced primal-dual path-following algorithms for solving second-order cone programming problems. In this paper, we generalize their work by using the machinery of Euclidean Jordan alg...

متن کامل

COMPUTATIONALLY EFFICIENT OPTIMUM DESIGN OF LARGE SCALE STEEL FRAMES

Computational cost of metaheuristic based optimum design algorithms grows excessively with structure size. This results in computational inefficiency of modern metaheuristic algorithms in tackling optimum design problems of large scale structural systems. This paper attempts to provide a computationally efficient optimization tool for optimum design of large scale steel frame structures to AISC...

متن کامل

A domain decomposition algorithm for contact problems with Coulomb’s friction

Contact problems of elasticity are used in many fields of science and engineering, especially in structural mechanics, geology and biomecanics. Many numerical procedures solving contact problems have been proposed in the engineering literature. They are based on standard discretization techniques for partial differential equations in combination with a special implementation of non-linear conta...

متن کامل

Testing Soccer League Competition Algorithm in Comparison with Ten Popular Meta-heuristic Algorithms for Sizing Optimization of Truss Structures

Recently, many meta-heuristic algorithms are proposed for optimization of various problems. Some of them originally are presented for continuous optimization problems and some others are just applicable for discrete ones. In the literature, sizing optimization of truss structures is one of the discrete optimization problems which is solved by many meta-heuristic algorithms. In this paper, in or...

متن کامل

Efficient Algorithms for Just-In-Time Scheduling on a Batch Processing Machine

Just-in-time scheduling problem on a single batch processing machine is investigated in this research. Batch processing machines can process more than one job simultaneously and are widely used in semi-conductor industries. Due to the requirements of just-in-time strategy, minimization of total earliness and tardiness penalties is considered as the criterion. It is an acceptable criterion for b...

متن کامل

A multi-objective resource-constrained optimization of time-cost trade-off problems in scheduling project

This paper presents a multi-objective resource-constrained project scheduling problem with positive and negative cash flows. The net present value (NPV) maximization and making span minimization are this study objectives. And since this problem is considered as complex optimization in NP-Hard context, we present a mathematical model for the given problem and solve three evolutionary algorithms;...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • SIAM J. Scientific Computing

دوره 29  شماره 

صفحات  -

تاریخ انتشار 2007