An Analysis of Spectral Envelope-reduction via Quadratic Assignment Problems

@inproceedings{George1997AnAO,
  title={An Analysis of Spectral Envelope-reduction via Quadratic Assignment Problems},
  author={Alan George and Alex Pothen},
  year={1997}
}
A new spectral algorithm for reordering a sparse symmetric matrix to reduce its envelope size was described in [2]. 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 1and 2-sum problems; the former is related to the envelope size, while the latter is related to an upper bound on the work… CONTINUE READING

Citations

Publications citing this paper.
Showing 1-10 of 30 extracted citations

References

Publications referenced by this paper.
Showing 1-7 of 7 references

And 5

I. S. DUFF, J. K. REID
A. SCOTT, The use of profile reduction algorithms with a frontal code, International Journal for Numerical Methods in Engineering, 28 • 1989
View 1 Excerpt

The effect of ordering on preconditioned conjugate gradients

I. S. DUFF, G. A. MEURANT
BIT, 29 • 1989
View 1 Excerpt

Direct Methods for Sparse Ma-trices

I. S. DUFF, A. M. ERISMAN, J. K. REID
Clarendon Press, Oxford • 1986
View 1 Excerpt

_1

N. ALON, V. MILMAN
isoperimetric inequalities for graphs, and superconcentrators, J. of Combin. Theory, Series B, 38 • 1985
View 2 Excerpts

CUTHILL AND 5. MCKEE, Reducing the bandwidth of sparse symmetric matrices

E H.
Proceedings of the 24th Nat. Conf. ACM, • 1969
View 3 Excerpts

Similar Papers

Loading similar papers…