×

Toward a universal h-p adaptive finite element strategy. I: Constrained approximation and data structure. (English) Zbl 0723.73074

The present article is the first one of the trilogy of papers [see the following entries (Zbl 0723.73075; Zbl 0723.73076)] on the development of an adaptive h-p version (h: sizes of the elements; p: orders of the shape functions) of the finite element method for the solution of various boundary value problems in solid and fluid mechanics. For the h-p method represents significant departures from conventional finite element techniques, a resolution of several formidable problems in their effective implementation is required, such as new data structures, equation solvers and certain criteria for choosing a distribution of mesh sizes and approximate orders.
In Part 1 of the presentation, general formulation issues are taken up, the data structure is developed, and the h-p adaptive strategy is introduced, thus contributing to a finite element scheme for linear elliptic boundary-value problems characterized by general elliptic systems of partial differential equations. In particular, the h- and p- adaptive is discussed, restricting the irregularity of the considered meshes to the index one. Furthermore, the concept of constrained approximation is outlined and its impact on such basic ingredients to the FEM as element stiffness matrix and load vector calculations is presented. The following discussion on the h-p adaptive finite element method is then restricted to the two-dimensional case, where the initial mesh is topologically a portion of a regular, rectangular grid in \({\mathbb{R}}^ 2\). Finally, some details concerning the data structure are given. The paper concludes with a presentation of four illustrative examples and some details on forms of the corresponding variational formulations.
Reviewer: W.Ehlers (Essen)

MSC:

74S05 Finite element methods applied to problems in solid mechanics
76M10 Finite element methods applied to problems in fluid mechanics
65N30 Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs
74S30 Other numerical methods in solid mechanics (MSC2010)
74P10 Optimization of other properties in solid mechanics
PDF BibTeX XML Cite
Full Text: DOI

References:

[1] Guo, B.; Babuška, I.; Guo, B.; Babuška, I., The \(h-p\) version of the finite element method, parts 1 and 2, Comput. mech., Comput. mech., 1, 203-220, (1986) · Zbl 0634.73059
[2] Babuška, I.; Suri, M., The \(h-p\) version of the finite element method with quasiuniform meshes, RAIRO math. mod. and numer. anal., 21, 2, 199-238, (1987) · Zbl 0623.65113
[3] Gui, W.; Babuška, I., The \(h, p\) and \(h-p\) versions of the finite element method in one dimension, parts 1, 2, 3, Numer. math., 49, 577-683, (1986) · Zbl 0614.65090
[4] Devloo, Ph.; Oden, J.T.; Pattani, P., An \(h-p\) adaptive finite element method for the numerical simulation of compressible flow, Comput. methods appl. mech. engrg., 70, 203-235, (1988) · Zbl 0636.76064
[5] Delves, L.M.; Hall, C., An implicit matching principle for global element calculations, J. inst. of math. and its applications, 23, 223-234, (1979) · Zbl 0443.65087
[6] Rheinboldt, W.C.; Mesztenyi, Ch.K., On a data structure for adaptive finite element mesh refinements, ACM trans. math. software, 6, 2, 166-187, (1980) · Zbl 0437.65081
[7] L. Demkowicz and J.T. Oden, A review of local mesh refinement techniques and corresponding data structures in h-type adaptive finite element methods, TICOM Rept. 88-02, The Texas Institute for Computational Mechanics, The University of Texas at Austin, Texas 78712.
[8] Bank, R.E.; Sherman, A.H.; Weiser, A., Refinement algorithms and data structures for regular mesh refinement, (), 3-17
[9] Ciarlet, P.G., The finite element method for elliptic problems, (1978), North-Holland Amsterdam · Zbl 0445.73043
[10] Oden, J.T.; Carey, G.F., Finite elements: mathematical aspects IV, (1983), Prentice-Hall Englewood Cliffs · Zbl 0496.65055
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.