An algorithm for improved convergence in forming analysis (Q1384329)
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: An algorithm for improved convergence in forming analysis |
scientific article; zbMATH DE number 1140375
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An algorithm for improved convergence in forming analysis |
scientific article; zbMATH DE number 1140375 |
Statements
An algorithm for improved convergence in forming analysis (English)
0 references
13 April 1998
0 references
A new algorithm has been developed based on the mesh normal and using a consistent full set (N-CFS) of equations, including equilibrium and contact conditions in the nonlinear set. The ``N-CFS'' algorithm exhibits remarkable stability and strong convergence. We have not found a well-posed problem, i.e. one which is physically stable within the discrete numerical framework, which exhibits numerical instability. Several challenging example problems are solved, illustrating the robustness of the new method.
0 references
consistent full set of equations
0 references
mesh normal
0 references
stability
0 references
convergence
0 references