Complexity of Vectorized Solution of Two-Dimensional Finite Element Grids.
Abstract
Given a two-dimensional grid of (2 sup n)-2 rectangular finite elements with m+2 nodes/side and l variables/node, a general dissection strategy is proposed for direct solution of the associated matrix equation. Expressions are developed in terms of m, n, and l for (1) the total number of multiplications and subtractions, and (2) a tight upper bound for the number of vector operations involved. The 'average vector length' L(ave) is defined as the ratio total operations/total vectors, and is shown useful as a gross measure of vectorization efficiency. The efficiency of current vector processors in solving dissected grids is evaluated using this measure.
Document Details
- Document Type
- Technical Report
- Publication Date
- Nov 01, 1975
- Accession Number
- ADA019532
Entities
People
- Donald Albert Calahan
Organizations
- University of Michigan