Zobrazit minimální záznam

dc.contributor.authorDostál, Zdeněk
dc.contributor.authorHaslinger, Jaroslav
dc.contributor.authorKučera, Radek
dc.date.accessioned2007-09-14T07:39:45Z
dc.date.available2007-09-14T07:39:45Z
dc.date.issued2002
dc.identifier.citationJournal of Computational and Applied Mathematics. 2002, vol. 140, issues 1-2, p. 245-256.en
dc.identifier.issn0377-0427
dc.identifier.urihttp://hdl.handle.net/10084/62762
dc.language.isoenen
dc.publisherNorth-Hollanden
dc.relation.ispartofseriesJournal of Computational and Applied Mathematicsen
dc.relation.urihttp://dx.doi.org/10.1016/S0377-0427(01)00405-8en
dc.subjectcontact problemen
dc.subjectdual formulationen
dc.subjectfixed point methoden
dc.subjectquadratic programmingen
dc.titleImplementation of the fixed point method in contact problems with Coulomb friction based on a dual splitting type techniqueen
dc.typearticleen
dc.identifier.locationNení ve fondu ÚKen
dc.description.abstract-enThe paper deals with the numerical solution of the quasi-variational inequality describing the equilibrium of an elastic body in contact with a rigid foundation under Coulomb friction. After a discretization of the problem by mixed finite elements, the duality approach is exploited to reduce the problem to a sequence of quadratic programming problems with box constraints, so that efficient recently proposed algorithms may be applied. A new variant of this method is presented. It combines fixed point with block Gauss–Seidel iterations. The method may be also considered as a new implementation of fixed point iterations for a sequence of problems with given friction. Results of numerical experiments are given showing that the resulting algorithm may be much faster than the original fixed point method and its efficiency is comparable with the solution of frictionless contact problems.en
dc.identifier.doi10.1016/S0377-0427(01)00405-8
dc.identifier.wos000174733100015


Soubory tohoto záznamu

SouboryVelikostFormátZobrazit

K tomuto záznamu nejsou připojeny žádné soubory.

Tento záznam se objevuje v následujících kolekcích

Zobrazit minimální záznam