Binary tree eigen solver in finite element analysis
This paper presents a transputer-based binary tree eigensolver for the solution of the generalized eigenproblem in linear elastic finite element analysis. The algorithm is based on the method of recursive doubling, which parallel implementation of a number of associative operations on an arbitrary set having N elements is of the order of o(log2N), compared to (N-1) steps if implemented sequentially. The hardware used in the implementation of the binary tree consists of 32 transputers. The algorithm is written in OCCAM which is a high-level language developed with the transputers to address parallel programming constructs and to provide the communications between processors. The algorithm can be replicated to match the size of the binary tree transputer network. Parallel and sequential finite element analysis programs have been developed to solve for the set of the least-order eigenpairs using the modified subspace method. The speed-up obtained for a typical analysis problem indicates close agreement with the theoretical prediction given by the method of recursive doubling. 5 refs.
- OSTI ID:
- 6020620
- Report Number(s):
- AIAA-Paper-93-1493; CONF-9304186-
- Resource Relation:
- Conference: 34. American Institute of Aeronautics and Astronautics/American Society of Mechanical Engineers (AIAA/ASME) adaptive structures conference, La Jolla, CA (United States), 19-22 Apr 1993; Other Information: 1607-1612
- Country of Publication:
- United States
- Language:
- English
Similar Records
Pattern recognition and interpretation by a binary tree of processors
A parallel additive Schwarz preconditioned Jacobi-Davidson algorithm for polynomial eigenvalue problems in quantum dot simulation