COMPLEXITY OF VECTORIZED SOLUTION OF TWO-DIMENSIONAL FINITE ELEMENT GRIDS*
暂无分享,去创建一个
The dissected direct solution of finite-element grids has been shown to be more efficient than band-related methods. In this paper, it is shown that vector processors can be used to solve such grids despite their apparent disassociated structure. Operation counts and vector counts are given as a function of grid size and order of rectangular element.
[1] A. George. On Block Elimination for Sparse Linear Systems , 1974 .
[2] William G. Poole,et al. System balance analysis for vector computers , 1975, ACM '75.