An Analysis of Spectral Envelope Reduction via Quadratic Assignment Problems

Authors:
Alan George;Alex Pothen
Affiliations:
-;-
Venue:
SIAM Journal on Matrix Analysis and Applications
Year:
1997

Citing 0
Cited 6

Efficient Join-Index-Based Spatial-Join Processing: A Clustering Approach

IEEE Transactions on Knowledge and Data Engineering
Monte Carlo Techniques for Estimating the Fiedler Vector in Graph Applications

ICCS '02 Proceedings of the International Conference on Computational Science-Part II
Unravelling small world networks

Journal of Computational and Applied Mathematics - Special issue: Selected papers from the conference on computational and mathematical methods for science and engineering (CMMSE-2002) Alicante University, Spain, 20-25 september 2002
PHALANX: a graph-theoretic framework for test case prioritization

Proceedings of the 2008 ACM symposium on Applied computing
Multilevel algorithms for linear ordering problems

Journal of Experimental Algorithmics (JEA)
Enhancing the stability and efficiency of spectral ordering with partial supervision and feature selection

Knowledge and Information Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

A new spectral algorithm for reordering a sparse symmetric matrix to reduce its envelope size was described in [Barnard, Pothen, and Simon, Numer. Linear Algebra Appl., 2 (1995), pp. 317--334]. The ordering is computed by associating a Laplacian matrix with the given matrix and then sorting the components of a specified eigenvector of the Laplacian. In this paper we provide an analysis of the spectral envelope reduction algorithm. We describe related 1- and 2-sum problems; the former is related to the envelope size, while the latter is related to an upper bound on the work in an envelope Cholesky factorization. We formulate these two problems as quadratic assignment problems and then study the 2-sum problem in more detail. We obtain lower bounds on the 2-sum by considering a relaxation of the problem and then show that the spectral ordering finds a permutation matrix closest to an orthogonal matrix attaining the lower bound. This provides a stronger justification of the spectral envelope reduction algorithm than previously known. The lower bound on the 2-sum is seen to be tight for reasonably "uniform" finite element meshes. We show that problems with bounded separator sizes also have bounded envelope parameters.