An Analysis of Spectral Envelope Reduction via Quadratic Assignment Problems

DOI10.1137/S089547989427470XzbMath0874.65032OpenAlexW2082381175MaRDI QIDQ4339126

No author found.

Publication date: 5 June 1997

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s089547989427470x

zbMATH Keywords

Cholesky factorizationLaplacian matrixeigenvalues of graphssparse symmetric matrixquadratic assignment problemsreordering algorithms1-sum problem2-sum problemspectral envelope reduction algorithm

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Graph theory (including graph drawing) in computer science (68R10) Discrete location and assignment (90B80)

Related Items (10)

Leveraging special-purpose hardware for local search heuristics ⋮ Convex Relaxations for Permutation Problems ⋮ Two improved algorithms for envelope and wavefront reduction ⋮ Unravelling small world networks ⋮ Continuation methods for approximate large scale object sequencing ⋮ An experimental comparison of seriation methods for one-mode two-way data ⋮ A survey of direct methods for sparse linear systems ⋮ The quadratic assignment problem is easy for Robinsonian matrices with Toeplitz structure ⋮ A GRAPH BASED DAVIDSON ALGORITHM FOR THE GRAPH PARTITIONING PROBLEM ⋮ Addressing the envelope reduction of sparse matrices using a genetic programming system

This page was built for publication: An Analysis of Spectral Envelope Reduction via Quadratic Assignment Problems