On principles for the selection of shape functions for the Generalized Finite Element Method
✍ Scribed by Ivo Babuška; Uday Banerjee; John E. Osborn
- Publisher
- Elsevier Science
- Year
- 2002
- Tongue
- English
- Weight
- 391 KB
- Volume
- 191
- Category
- Article
- ISSN
- 0045-7825
No coin nor oath required. For personal study only.
✦ Synopsis
Effective shape functions for the Generalized Finite Element Method should reflect the available information on the solution. This information is partially fuzzy, because the solution is, of course, unknown, and typically the only available information is the solutionÕs inclusion in a variety of function spaces. It is desirable to choose shape functions that perform robustly over a family of relevant situations. Quantitative notions of robustness are introduced and discussed. We show, in particular, that in one dimension polynomials are robust when the available information consists in inclusions in Sobolev-type spaces that are x-independent.
📜 SIMILAR VOLUMES
Some elements commonly used for analysis are examined for completeness of polynomial interpolation and computational efficiency. Extensions to n-dimensional space are shown to be natural consequences of the interpolation, thus all elements considered here allow for finite element approximation in hi
## Abstract The inclusion principle provides a qualitative characterization of the eigenvalues of a matrix. The principle has been shown to apply to systems described by a single Hermitian matrix, the most important of which being the real symmetric matrix. Self‐adjoint distributed systems, when di