Actions for Parallel triangularization of substructured finite element problems

Email RIS file
Bookmark
Report an Issue

Parallel triangularization of substructured finite element problems

Author
Leuze, M. R.
Published
Sep 1, 1984.
Physical Description
1 electronic document
Online Version

Availability

I Want It
I Want It

Finding items...

Restrictions on Access
Unclassified, Unlimited, Publicly available.
Free-to-read Unrestricted online access
Summary
Much of the computational effort of the finite element process involves the solution of a system of linear equations. The coefficient matrix of this system, known as the global stiffness matrix, is symmetric, positive definite, and generally sparse. An important technique for reducing the time required to solve this system is substructuring or matrix partitioning. Substructuring is based on the idea of dividing a structure into pieces, each of which can then be analyzed relatively indepenently. As a result of this division, each point in the finite element discretization is either interior to a substructure or on a boundary between substructures. Contributions to the global stiffness matrix from connections between boundary points from the K(bb) matrix are reported. The triangularization of a general K(bb) matrix on a parallel machine is specifically discussed.
Other Subject(s)
Collection
NASA Technical Reports Server (NTRS) Collection.
Note
Document ID: 19850003261.
Accession ID: 85N11569.
NAS 1.26:172466.
ICASE-84-47.
NASA-CR-172466.
Terms of Use and Reproduction
No Copyright.
View MARC record | catkey: 15706401