
Accession Number : ADA019532
Title : Complexity of Vectorized Solution of TwoDimensional Finite Element Grids.
Descriptive Note : Technical interim rept.,
Corporate Author : MICHIGAN UNIV ANN ARBOR SYSTEMS ENGINEERING LAB
Personal Author(s) : Calahan,D. A.
Report Date : NOV 1975
Pagination or Media Count : 37
Abstract : Given a twodimensional 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.
Descriptors : *Finite element analysis, *Computations, Matrices(Mathematics), Algorithms, Computer programs
Subject Categories : Theoretical Mathematics
Computer Programming and Software
Distribution Statement : APPROVED FOR PUBLIC RELEASE