Parallel triangularization of substructured finite element problems
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.
- Parallel algorithms for the finite element method
- A parallel finite element solution method
- Parallel finite element splitting-up method for parabolic problems
- A Parallel Implementation of the p-Version of the Finite Element Method
- scientific article; zbMATH DE number 792702
- Parallel methods for tridiagonal equations
- Parallel-vector computations for geometrically nonlinear finite element analysis
- An intrinsically parallel finite element method
- scientific article; zbMATH DE number 592813
This page was built for publication: Parallel triangularization of substructured finite element problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1072337)
