Efficient time stepping for the multiplicative Maxwell fluid including the Mooney‐Rivlin hyperelasticity

Summary A popular version of the finite‐strain Maxwell fluid is considered, which is based on the multiplicative decomposition of the deformation gradient tensor. The model combines Newtonian viscosity with hyperelasticity of the Mooney‐Rivlin type; it is a special case of the viscoplasticity model...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:International journal for numerical methods in engineering Ročník 113; číslo 12; s. 1851 - 1869
Hlavní autor: Shutov, A. V.
Médium: Journal Article
Jazyk:angličtina
Vydáno: Bognor Regis Wiley Subscription Services, Inc 23.03.2018
Témata:
ISSN:0029-5981, 1097-0207
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Summary A popular version of the finite‐strain Maxwell fluid is considered, which is based on the multiplicative decomposition of the deformation gradient tensor. The model combines Newtonian viscosity with hyperelasticity of the Mooney‐Rivlin type; it is a special case of the viscoplasticity model proposed by Simo and Miehe in 1992. A simple, efficient, and robust implicit time‐stepping procedure is suggested. Lagrangian and Eulerian versions of the algorithm are available, with equivalent properties. The numerical scheme is iteration free, unconditionally stable, and first order accurate. It exactly preserves the inelastic incompressibility, symmetry, and positive definiteness of the internal variables and w‐invariance. The accuracy of the stress computations is tested using a series of numerical simulations involving a nonproportional loading and large strain increments. In terms of accuracy, the proposed algorithm is equivalent to the modified Euler backward method with exact inelastic incompressibility; the proposed method is also equivalent to the classical integration method based on exponential mapping. Since the new method is iteration free, it is more robust and computationally efficient. The algorithm is implemented into MSC.MARC, and a series of initial boundary value problems is solved to demonstrate the usability of the numerical procedures.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0029-5981
1097-0207
DOI:10.1002/nme.5724