Product or sum with transposed matrix: what is best for unsymmetric sparse matrix compression

Authors:
M. M. Stabrowski
Affiliations:
Department of Electrical Engineering, Lublin University of Technology, Katedra Informatyki, Nadbystrycka 36b, Lublin PL 20618, Poland
Venue:
Advances in Engineering Software
Year:
2004

Citing 6
Cited 0

Sparse matrix test problems

ACM Transactions on Mathematical Software (TOMS)
Numerical algorithms with C

Numerical algorithms with C
A Supernodal Approach to Sparse Partial Pivoting

SIAM Journal on Matrix Analysis and Applications
Object-oriented approach to the reduction of matrix bandwidth, profile and wavefront

Advances in Engineering Software
Reducing the bandwidth of sparse symmetric matrices

ACM '69 Proceedings of the 1969 24th national conference
An object-oriented collection of minimum degree algorithms: Design, implementation, and experiences

An object-oriented collection of minimum degree algorithms: Design, implementation, and experiences

Quantified Score

Hi-index	0.00

Visualization

Abstract

Object-oriented software for sparse matrix compression is briefly presented. Two approaches to unsymmetric sparse matrix compression are investigated. The first determines row reordering using the sum of original and transposed matrix. The second method uses the product of original and transposed matrix. Both methods are comprehensively compared using assorted matrices derived from engineering applications. These tests prove that best results are obtained, practically always, with the aid of 'summation' method.