Interchange opportunity in average bandwidth reduction in sparse matrices

DOI10.2478/V10324-012-0015-2zbMATH Open1289.65120OpenAlexW2103837337MaRDI QIDQ2845787FDOQ2845787

Authors: Liviu Octavian Mafteiu-Scai 

Publication date: 3 September 2013

Published in: Analele Universității de Vest din Timișoara. Seria Matematică-Informatică (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2478/v10324-012-0015-2

Recommendations

• A constructive bandwidth reduction algorithm
• Heuristic spectral techniques for the reduction of bandwidth and work-bound of sparse matrices
• Reducing the bandwidth of a sparse matrix with tabu search.
• A new matrix bandwidth reduction algorithm
• scientific article; zbMATH DE number 4037041

zbMATH Keywords

sparse matrixsymmetric matricesheuristic algorithmsbandwidth reductionnature inspired heuristics

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50)

This page was built for publication: Interchange opportunity in average bandwidth reduction in sparse matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2845787)