Remarks on the interpretation of current nonlinear finite element analyses as differential-algebraic equations (Q2745448)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Remarks on the interpretation of current nonlinear finite element analyses as differential-algebraic equations |
scientific article; zbMATH DE number 1654693
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Remarks on the interpretation of current nonlinear finite element analyses as differential-algebraic equations |
scientific article; zbMATH DE number 1654693 |
Statements
21 July 2003
0 references
time adaptivity
0 references
consistent tangent
0 references
stress computation
0 references
multilevel Newton method
0 references
quadratical convergence
0 references
differential-algebraic equations
0 references
diagonally implicit Runge-Kutta methods
0 references
principle of virtual displacements
0 references
backward Euler schemes
0 references
local time integration
0 references
step-size control techniques
0 references
Remarks on the interpretation of current nonlinear finite element analyses as differential-algebraic equations (English)
0 references
For the numerical solution of materially nonlinear problems like in computational plasticity or viscoplasticity, the finite element (FE) discretization in space is usually coupled with pointwise defined evolution equations characterizing the material behaviour. The interpretation of such systems as differential-algebraic equations (DAE) allows modern-day integration algorithms from numerical mathematics to be efficiently applied. Especially, the application of diagonally implicit Runge-Kutta methods together with a multilevel-Newton (MN) method preserves the algorithmic structure of current FE implementations which are based on the principle of virtual displacements and on backward Euler schemes for local time integration. The quadratical order of convergence of the MN algorithm is usually validated by numerical studies. Here the authors show that an analytical proof can be applied in the current context, based on the DAE interpretation mentioned above. The article concludes with some examples showing the performance of step-size control techniques as well as different integration procedures.
0 references