Heuristic spectral techniques for the reduction of bandwidth and work-bound of sparse matrices
From MaRDI portal
Publication:5959245
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
iterative methodsparse matricesspectral methodLaplacian matrixbandwidth reductionenvelope sizesecond eigenvector
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
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
This page was built for publication: Heuristic spectral techniques for the reduction of bandwidth and work-bound of sparse matrices
