论文信息 - Heuristics for a Matrix Symmetrization Problem

Heuristics for a Matrix Symmetrization Problem

We consider the following problem: given a square, nonsymmetric, (0, 1)-matrix, find a permutation of its columns that yields a zero-free diagonal and maximizes the symmetry. The problem is known to be NP-hard. We propose a fast iterative-improvement based heuristic and evaluate the performance of the heuristic on a large set of matrices.

Bora Uçar

[1] Jennifer A. Scott,et al. Ordering techniques for singly bordered block diagonal forms for unsymmetric parallel sparse direct solvers , 2005, Numer. Linear Algebra Appl..

[2] Curt Jones,et al. Finding Good Approximate Vertex and Edge Partitions is NP-Hard , 1992, Inf. Process. Lett..

[3] Iain S. Duff,et al. On Algorithms For Permuting Large Entries to the Diagonal of a Sparse Matrix , 2000, SIAM J. Matrix Anal. Appl..

[4] Tamara G. Kolda,et al. Partitioning Rectangular and Structurally Unsymmetric Sparse Matrices for Parallel Processing , 1999, SIAM J. Sci. Comput..

[5] Brian W. Kernighan,et al. An efficient heuristic procedure for partitioning graphs , 1970, Bell Syst. Tech. J..

[6] Vladimir Gurvich,et al. Neighborhood hypergraphs of bipartite graphs , 2008, J. Graph Theory.

[7] I. Duff,et al. Direct Methods for Sparse Matrices , 1987 .

[8] Michele Benzi,et al. Preconditioning Highly Indefinite and Nonsymmetric Matrices , 2000, SIAM J. Sci. Comput..

[9] Brendan D. McKay,et al. A Correction to Colbourn's Paper on the Complexity of Matrix Symmetrizability , 1980, Inf. Process. Lett..

[10] Alex Pothen,et al. Computing the block triangular form of a sparse matrix , 1990, TOMS.

[11] Jennifer A. Scott,et al. Reducing the Total Bandwidth of a Sparse Unsymmetric Matrix , 2006, SIAM J. Matrix Anal. Appl..