Performances of matrix storage schemes in parallel finite element analysis

Authors:
Sang-Youp Synn
Affiliations:
-
Venue:
HPC-ASIA '97 Proceedings of the High-Performance Computing on the Information Superhighway, HPC-Asia '97
Year:
1997

Citing 2
Cited 0

The role of elimination trees in sparse factorization

SIAM Journal on Matrix Analysis and Applications
Reducing the bandwidth of sparse symmetric matrices

ACM '69 Proceedings of the 1969 24th national conference

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper discusses several issues such as numerical methods, information storage, renumbering related to parallel direct method and presents the performances of several matrix storage schemes in parallel matrix computation. The performances are measured at the computation on the BBN-butterfly parallel machine. The result of actual computation indicates that the performance benefit of each matrix storage scheme depends on the matrix pattern.