Heuristic spectral techniques for the reduction of bandwidth and work-bound of sparse matrices

DOI10.1023/A:1014082430392zbMath0991.65043OpenAlexW1664688015MaRDI QIDQ5959245

Gianna M. Del Corso, Francesco Romani

Publication date: 26 March 2002

Published in: Numerical Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1014082430392

zbMATH Keywords

iterative methodsparse matricesspectral methodLaplacian matrixbandwidth reductionenvelope sizesecond eigenvector

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Graph theory (including graph drawing) in computer science (68R10) Iterative numerical methods for linear systems (65F10) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (2)

GRASP and path relinking for the matrix bandwidth minimization. ⋮ On some properties of the Laplacian matrix revealed by the RCM algorithm

Uses Software

• SparseMatrix

This page was built for publication: Heuristic spectral techniques for the reduction of bandwidth and work-bound of sparse matrices