Parallel triangularization of substructured finite element problems (Q1072337)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Parallel triangularization of substructured finite element problems |
scientific article |
Statements
Parallel triangularization of substructured finite element problems (English)
0 references
1986
0 references
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 independently. 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 form the \(K_{bb}\) matrix. This paper focuses on the triangularization of a general \(K_{bb}\) matrix on a parallel machine.
0 references
finite element
0 references
stiffness matrix
0 references
substructuring
0 references
matrix partitioning
0 references