Premium
A parallel computational method in steady power‐law creep
Author(s) -
Klebanov I. M.,
Davydov A. N.
Publication year - 2001
Publication title -
international journal for numerical methods in engineering
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.421
H-Index - 168
eISSN - 1097-0207
pISSN - 0029-5981
DOI - 10.1002/nme.96
Subject(s) - domain decomposition methods , convergence (economics) , creep , dissipation , computer science , mathematics , power law , computational science and engineering , plasticity , linear elasticity , mathematical optimization , finite element method , structural engineering , engineering , physics , thermodynamics , statistics , economics , economic growth
Abstract A new approach to parallelization of materially non‐linear problems in solid mechanics is developed. It is based on approximating generalized models of subdomains. The procedure does not retain the same substructuring technique used in a linear version. The convergence proof of the single‐ and multilevel‐domain decomposition algorithms uses the principle of minimum potential energy dissipation and investigated properties of the substructural models. The high efficiency of the approach introduced is shown through the study of several examples. The method developed in this paper for steady creep can be used without modification to solve non‐linear elasticity problems and, at active loading, plasticity problems for bodies of the power‐law strain–stress diagrams. Copyright © 2001 John Wiley & Sons, Ltd.