Mostra el registre d'ítem simple

dc.contributor.authorPérez Foguet, Agustí
dc.contributor.authorArmero, F
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament d'Enginyeria Civil i Ambiental
dc.date.accessioned2010-07-20T07:46:40Z
dc.date.available2010-07-20T07:46:40Z
dc.date.created2002-01
dc.date.issued2002-01
dc.identifier.citationPérez, A.; Armero, F. On the formulation of closest-point projection algorithms in elastoplasticity. Part II: globally convergent schemes. "International journal for numerical methods in engineering", Gener 2002, vol. 53, núm. 2, The definitive version is available at http://www3.interscience.wiley.com/journal/86513085/abstract, p. 331-374.
dc.identifier.issn0029-5981
dc.identifier.urihttp://hdl.handle.net/2117/8254
dc.description.abstractThis paper presents the formulation of numerical algorithms for the solution of the closest-point projection equations that appear in typical implementations of return mapping algorithms in elastoplasticity. The main motivation behind this work is to avoid the poor global convergence properties of a straight application of a Newton scheme in the solution of these equations, the so-called Newton-CPPM. The mathematical structure behind the closest-point projection equations identified in Part I of this work delineates clearly different strategies for the successful solution of these equations. In particular, primal and dual closest-point projection algorithms are proposed, in non-augmented and augmented Lagrangian versions for the imposition of the consistency condition. The primal algorithms involve a direct solution of the original closest-point projection equations, whereas the dual schemes involve a two-level structure by which the original system of equations is staggered, with the imposition of the consistency condition driving alone the iterative process. Newton schemes in combination with appropriate line search strategies are considered, resulting in the desired asymptotically quadratic local rate of convergence and the sought global convergence character of the iterative schemes. These properties, together with the computational performance of the different schemes, are evaluated through representative numerical examples involving different models of finite-strain plasticity. In particular, the avoidance of the large regions of no convergence in the trial state observed in the standard Newton-CPPM is clearly illustrated.
dc.format.extent44 p.
dc.language.isoeng
dc.publisherWiley and Sons
dc.subjectÀrees temàtiques de la UPC::Matemàtiques i estadística
dc.subject.lcshElastoplasticity--Mathematical models
dc.subject.otherElastoplasticity
dc.subject.otherReturn mapping algorithms
dc.subject.otherClosest-point projection
dc.subject.otherGlobally convergent schemes
dc.subject.otherAugmented Lagrangian
dc.titleOn the formulation of closest-point projection algorithms in elastoplasticity. Part II: globally convergent schemes
dc.typeArticle
dc.subject.lemacElastoplasticitat
dc.subject.lemacDeformacions (Mecànica) -- Models matemàtics
dc.contributor.groupUniversitat Politècnica de Catalunya. LACÀN - Mètodes Numèrics en Ciències Aplicades i Enginyeria
dc.identifier.doi10.1002/nme.279 
dc.description.peerreviewedPeer Reviewed
dc.rights.accessOpen Access
local.identifier.drac799257
dc.description.versionPostprint (author’s final draft)
local.citation.authorPérez, A.; Armero, F.
local.citation.otherThe definitive version is available at http://www3.interscience.wiley.com/journal/86513085/abstract
local.citation.publicationNameInternational journal for numerical methods in engineering
local.citation.volume53
local.citation.number2
local.citation.startingPage331
local.citation.endingPage374


Fitxers d'aquest items

Thumbnail

Aquest ítem apareix a les col·leccions següents

Mostra el registre d'ítem simple