𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A data structure for finite element analysis

✍ Scribed by J. A. Bettess

Publisher
John Wiley and Sons
Year
1977
Tongue
English
Weight
715 KB
Volume
11
Category
Article
ISSN
0029-5981

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

The philosophy of a simple data structure for handling data for finite element analyses is described. The technique is advocated as an efficient way of handling finite element data and of communicating between programs using the data.

πŸ“œ SIMILAR VOLUMES

Derived data structure algorithms for un
Derived data structure algorithms for unstructured finite element meshes
✍ Jacob Waltz πŸ“‚ Article πŸ“… 2002 πŸ› John Wiley and Sons 🌐 English βš– 107 KB

## Abstract A set of derived data structure algorithms for unstructured finite element meshes is presented. Both serial and parallel algorithms are described for each data structure. Colouring groups for the elements are used to facilitate parallelization on shared memory architectures. Scaling stu

Legendre spectral finite elements for st
Legendre spectral finite elements for structural dynamics analysis
✍ Sprague, M. A. ;Geers, T. L. πŸ“‚ Article πŸ“… 2007 πŸ› John Wiley and Sons 🌐 English βš– 189 KB

## Abstract Spectral, hierarchical, and __h__‐type finite elements (FEs) are compared in the context of their application to structural dynamics analysis. The Timoshenko beam, which is the 1‐D analog of Mindlin‐type shell elements, is used for comparison in eigenvalue and transient‐response analyse