Solution of contact problems by FETI domain decomposition with natural coarse space projections

dc.creatorDostal, Z
dc.creatorNeto, FAMG
dc.creatorSantos, SA
dc.date2000
dc.date2014-12-02T16:27:46Z
dc.date2015-11-26T16:03:26Z
dc.date2014-12-02T16:27:46Z
dc.date2015-11-26T16:03:26Z
dc.date.accessioned2018-03-28T22:52:40Z
dc.date.available2018-03-28T22:52:40Z
dc.identifierComputer Methods In Applied Mechanics And Engineering. Elsevier Science Sa, v. 190, n. 13-14, n. 1611, n. 1627, 2000.
dc.identifier0045-7825
dc.identifierWOS:000166333300003
dc.identifier10.1016/S0045-7825(00)00180-8
dc.identifierhttp://www.repositorio.unicamp.br/jspui/handle/REPOSIP/71847
dc.identifierhttp://www.repositorio.unicamp.br/handle/REPOSIP/71847
dc.identifierhttp://repositorio.unicamp.br/jspui/handle/REPOSIP/71847
dc.identifier.urihttp://repositorioslatinoamericanos.uchile.cl/handle/2250/1265264
dc.descriptionAn efficient tron-overlapping domain decomposition algorithm of the Neumann-Neumann type for solving both coercive and semicoercive contact problems is presented. The discretized problem is first turned by the duality theory of convex programming to the quadratic programming problem with bound and equality constraints and the latter is further modified by means of orthogonal projectors to the natural coarse space introduced by Farhat and Roux in the framework of their FETI method. The resulting problem is then solved by an augmented Lagrangian type algorithm with an outer loop for the Lagrange multipliers for the equality constraints and an inner loop For the solution of the bound constrained quadratic programming problems. The projectors are shown to guarantee fast convergence of iterative solution of auxiliary linear problems and to comply with efficient quadratic programming algorithms proposed earlier. Reported theoretical results and numerical experiments indicate high numerical scalability of the algorithm which preserves the parallelism of the FETI methods. (C) 2000 Elsevier Science B.V. All rights reserved.
dc.description190
dc.description13-14
dc.description1611
dc.description1627
dc.languageen
dc.publisherElsevier Science Sa
dc.publisherLausanne
dc.publisherSuíça
dc.relationComputer Methods In Applied Mechanics And Engineering
dc.relationComput. Meth. Appl. Mech. Eng.
dc.rightsfechado
dc.rightshttp://www.elsevier.com/about/open-access/open-access-policies/article-posting-policy
dc.sourceWeb of Science
dc.subjectdomain decomposition
dc.subjectnatural coarse grid
dc.subjectcontact problem
dc.subjectConstraints
dc.subjectAlgorithm
dc.titleSolution of contact problems by FETI domain decomposition with natural coarse space projections
dc.typeArtículos de revistas


Este ítem pertenece a la siguiente institución