An adaptive solver for large-scale hierarchic finite element systems has been developed. A decision-making methodology aimed at selecting an optimal solution strategy on the basis of estimated conditioning, sparsity and memory requirements for a given problem has been devised. Numerical experiments
The p-version of the finite element method compared to an adaptive h-version for the deformation theory of plasticity
✍ Scribed by A. Düster; E. Rank
- Publisher
- Elsevier Science
- Year
- 2001
- Tongue
- English
- Weight
- 553 KB
- Volume
- 190
- Category
- Article
- ISSN
- 0045-7825
No coin nor oath required. For personal study only.
✦ Synopsis
A p-version of the ®nite element method is applied to the deformation theory of plasticity and the results are compared to a state-ofthe-art adaptive h-version. It is demonstrated that even for nonlinear elliptic problems the p-version is a very ef®cient discretization strategy.
📜 SIMILAR VOLUMES
## Abstract The paper is the second in the series addressing the __h‐p__ version of the finite element method for parabolic equations. The present paper addresses the case when in both variables, the spatial and time, the __h‐p__ version is used. Error estimation is given and numerical computations
Two practical and effective, h-~p-type. finite element adaptive procedures are presented. The procedures allow not only the final global energy norni error to be well estimated using hierarchic p-refinement, but in addition give a nearly optimal mesh. The de'sign of this is guided by the local infor
The paper is the first in the series addressing the h-p version of the finite element method for parabolic equations. The h-p version is applied to both time and space variables. The present paper addresses the case when in time the p-version with one single time element is used. Error estimation is
This paper describes an adaptive hp-version mesh reÿnement strategy and its application to the ÿnite element solution of one-dimensional ame propagation problems. The aim is to control the spatial and time discretization errors below a prescribed error tolerance at all time levels. In the algorithm,