✦ LIBER ✦

A hemivariational inequality and substationarity approach to the interface problem: Theory and prospects of applications

✍ Scribed by P.D. Panagiotopoulos; C.C. Baniotopoulos

Publisher: Elsevier Science
Year: 1984
Weight: 979 KB
Volume: 1
Category: Article
ISSN: 0264-682X
DOI: 10.1016/0264-682x(84)90006-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A hemivariational inequality approach to

A hemivariational inequality approach to the unilateral contact problem and substationarity principles

✍ Panagiotopoulos, P. D. ;Avdelas, A. V. 📂 Article 📅 1984 🏛 Springer-Verlag ⚖ 698 KB

The application of stress theory to the

The application of stress theory to the study of family violence: Principles, problems, and prospects

✍ Keith Farrington 📂 Article 📅 1986 🏛 Springer 🌐 English ⚖ 1010 KB

A variational inequality and quadratic p

A variational inequality and quadratic programming approach to the separation problem of steel bolted brackets

✍ C.C. Baniotopoulos; K.M. Abdalla; P.D. Panagiotopoulos 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 725 KB

A method of approach to problems of the

A method of approach to problems of the theory of heat conduction, diffusion and the wave theory and other similar problems in presence of moving boundaries and its applications to other problems

✍ G.A Grinberg 📂 Article 📅 1967 🏛 Elsevier Science 🌐 English ⚖ 789 KB

Quasi-variational inequalities and appli

Quasi-variational inequalities and applications to the traffic equilibrium problem; discussion of a paradox

✍ Marino de Luca; Antonino Maugeri 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 502 KB

The FETI family of domain decomposition

The FETI family of domain decomposition methods for inequality-constrained quadratic programming: Application to contact problems with conforming and nonconforming interfaces

✍ Philip Avery; Charbel Farhat 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 372 KB

Two domain decomposition methods with Lagrange multipliers for solving iteratively quadratic programming problems with inequality constraints are presented. These methods are based on the FETI and FETI-DP substructuring algorithms. In the case of linear constraints, they do not perform any Newton-li