Maximum-weighted matching strategies and the application to symmetric indefinite systems

Authors:
Stefan Röllin;Olaf Schenk
Affiliations:
Integrated Systems Laboratory, Swiss Federal Institute of Technology Zurich, Zurich, Switzerland;Department of Computer Science, University Basel, Basel, Switzerland
Venue:
PARA'04 Proceedings of the 7th international conference on Applied Parallel Computing: state of the Art in Scientific Computing
Year:
2004

Citing 5
Cited 1

A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs

SIAM Journal on Scientific Computing
Preconditioning Highly Indefinite and Nonsymmetric Matrices

SIAM Journal on Scientific Computing
On Algorithms For Permuting Large Entries to the Diagonal of a Sparse Matrix

SIAM Journal on Matrix Analysis and Applications
MA57---a code for the solution of sparse symmetric definite and indefinite systems

ACM Transactions on Mathematical Software (TOMS)
A numerical evaluation of HSL packages for the direct solution of large sparse, symmetric linear systems of equations

ACM Transactions on Mathematical Software (TOMS)

An out-of-core sparse symmetric-indefinite factorization method

ACM Transactions on Mathematical Software (TOMS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

The problem of finding good numerical preprocessing methods for the solution of symmetric indefinite systems is considered. Special emphasis is put on symmetric maximum-weighted matching strategies. The aim is to permute large elements of the matrix to diagonal blocks. Several variants for the block sizes are examined and the accuracies of the solutions are compared. It is shown that maximum-weighted matchings improve the accuracy of sparse direct linear solvers. The use of a strategy called full cycles results in an accurate and reliable factorization. Numerical experiments validate these conclusions.