## Abstract A straightforward and general computer program for assembling and solving (using Gauss elimination technique) widely sparsed finite element matrix equations with very large bandwidth and capable of handling different degreesβofβfreedom and variable bandwidth at different nodes, is descr
Program structure and architecture for a finite element machine
β Scribed by D. H. Norrie; C. I. W. Norrie
- Publisher
- John Wiley and Sons
- Year
- 1986
- Tongue
- English
- Weight
- 584 KB
- Volume
- 22
- Category
- Article
- ISSN
- 0029-5981
No coin nor oath required. For personal study only.
β¦ Synopsis
Superproblems in finite elements require either general-purpose or special-purpose computing machines whose capabilities are very much greater than those currently existing. The advantage of the latter type of machine is that it can be highly optimized for the particular class of problem for which it is designed and can, in principle, for a given generation of hardware, be designed to operate at a higher speed than a corresponding general-purpose computer. The Parallel Finite Element Machine (PARFEM) investigated at the University of Calgary has an architecture based on the finite element computational algorithms and employs a combination of parallel and vector processing. The overall architecture and program structure is described and the major design considerations outlined.
π SIMILAR VOLUMES
## 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.