z-logo
Premium
An adaptive multigrid technique for three‐dimensional elasticity
Author(s) -
Kočvara Michal
Publication year - 1993
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.1620361006
Subject(s) - hexahedron , multigrid method , finite element method , polygon mesh , adaptive mesh refinement , linear elasticity , mathematical optimization , mathematics , estimator , algorithm , quadratic equation , elasticity (physics) , mesh generation , computer science , computational science , geometry , partial differential equation , mathematical analysis , structural engineering , materials science , composite material , statistics , engineering
A program for finite element analysis of 3D linear elasticity problems is described. The program uses quadratic hexahedral elements. The solution process starts on an initial coarse mesh; here error estimators are determined by the standard Babuška‐Rheinboldt method and local refinement is performed by partitioning of indicated elements, each hexahedron into eight new elements. Then the discrete problem is solved on the second mesh and the refinement process proceeds in the following way‐on the ith mesh only the elements caused by refinement on the (i‐1)th mesh can be refined. The control of refinement is the task of the user because the dimension of the discrete problem grows very rapidly in 3D. The discrete problem is being solved by the frontal solution method on the initial mesh and by a newly developed and very efficient local multigrid method on the refined meshes. The program can be successfully used for solving problems with structural singularities, such as re‐entrant corners and moving boundary conditions. A numerical example shows that such problems are solved with the same efficiency as regular problems.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here