Analysis and Comparison of Reordering for Two Factorization Methods (LU and WZ) for Sparse Matrices

Authors:
Beata Bylina;Jarosław Bylina
Affiliations:
Department of Computer Science Institute of Mathematics, Marie Curie-Sklodowska University, Lublin, Poland 20-031;Department of Computer Science Institute of Mathematics, Marie Curie-Sklodowska University, Lublin, Poland 20-031
Venue:
ICCS '08 Proceedings of the 8th international conference on Computational Science, Part I
Year:
2008

Citing 8
Cited 0

Direct methods for sparse matrices

Direct methods for sparse matrices
The WZ matrix factorisation method

Parallel Computing
Existence and uniqueness of WZ factorization

Parallel Computing
BSP linear solvers for dense matrices

Parallel Computing
Analysis and comparison of two general sparse solvers for distributed memory computers

ACM Transactions on Mathematical Software (TOMS)
A Fully Asynchronous Multifrontal Solver Using Distributed Dynamic Scheduling

SIAM Journal on Matrix Analysis and Applications
Algorithm 837: AMD, an approximate minimum degree ordering algorithm

ACM Transactions on Mathematical Software (TOMS)
The university of Florida sparse matrix collection

ACM Transactions on Mathematical Software (TOMS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

The authors of the article make analysis and comparison of reordering for two factorizations of the sparse matrices --- the traditional factorization into the matrices Land Uas well as the factorization into matrices Wand Z. The article compares these two factorizations regarding: the produced quantity of non-zero elements alias their susceptibility to a fill-in; the algorithms reorganizing matrix (for LU it will be the algorithm AMD but for WZ it will be a modification of the Markowitz algorithm); as well as the time of the algorithms. The paper also describes the results of a numerical experiment carried for different sparse matrices from Davis Collection.