On the superlinear convergence in computational elasto-plasticity

نویسندگان

  • M. Sauter
  • C. Wieners
  • Martin Sauter
  • Christian Wieners
چکیده

We consider the convergence properties of return algorithms for a large class of rate-independent plasticity models. Based on recent results for semismooth functions, we can analyze these algorithms in the context of semismooth Newton methods guaranteeing local superlinear convergence. This recovers results for classical models but also extends to general hardening laws, multi-yield plasticity, and to several non-associated models. The superlinear convergence is also numerically shown for a large-scale parallel simulation of Drucker-Prager elasto-plasticity.

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

ثبت نام

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

منابع مشابه

Biorthogonal wavelet-based full-approximation schemes for the numerical solution of elasto-hydrodynamic lubrication problems

Biorthogonal wavelet-based full-approximation schemes are introduced in this paper for the numerical solution of elasto-hydrodynamic lubrication line and point contact problems. The proposed methods give higher accuracy in terms of better convergence with low computational time, which have been demonstrated through the illustrative problems.

متن کامل

The Effects of Geotechnical Material Properties on the Convergence of Iterative Solvers

There is increasing interest in the use of iterative rather than direct solvers for geotechnical finite element analysis. For large 3D problems iterative solvers offer the only possibility of economical solution on a desktop PC. The major stumbling block with iterative solvers is ensuring fast convergence to a suitably accurate solution. The system of equations is always “preconditioned” to imp...

متن کامل

Efficient First Order Superlinear Algorithms

Substantial number of problems in artificial intelligence requires optimization. Increasing complexity of the problems imposes several challenges on optimization algorithms. The algorithms must be fast, computationally efficient, and scalable. Balance between convergence speed and computational complexity is of central importance. Typical example is the task of training neural networks. Superli...

متن کامل

Regularity up to the Boundary for Nonlinear Elliptic Systems Arising in Time-Incremental Infinitesimal Elasto-plasticity

In this note we investigate the question of higher regularity up to the boundary for quasilinear elliptic systems which origin from the time-discretization of models from infinitesimal elasto-plasticity. Our main focus lies on an elasto-plastic Cosserat model. More specifically we show that the time discretization renders H-regularity of the displacement and H-regularity for the symmetric plast...

متن کامل

A Constraint-Reduced Algorithm for Semidefinite Optimization Problems with Superlinear Convergence

Constraint reduction is an essential method because the computational cost of the interior point methods can be effectively saved. Park and O’Leary proposed a constraint-reduced predictor-corrector algorithm for semidefinite programming with polynomial global convergence, but they did not show its superlinear convergence. We first develop a constraintreduced algorithm for semidefinite programmi...

متن کامل

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


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

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

ثبت نام

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

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011