Bandwidth reduction in sparse matrices

MaRDI QIDQ2893631zbMATH OpenFDO

Authors Liviu Octavian, Mafteiu Scai

Publication date 21 June 2012

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

zbMATH Keywords

sparse matricespreconditioningparallel processingheuristic algorithmsbandwidth reductionCuthill-Mckee's algorithm

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Parallel numerical computation (65Y05) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Preconditioners for iterative methods (65F08) Iterative numerical methods for linear systems (65F10)

Recommendations

• A constructive bandwidth reduction algorithm
• Algorithms for reducing the bandwidth and profile of a sparse matrix
• Metaheuristic algorithms for the bandwidth reduction of large-scale matrices
• An algorithm for profile and wavefront reduction of sparse matrices
• scientific article; zbMATH DE number 1330399

Cited in

(10)

• Reducing the bandwidth of a sparse matrix with tabu search.
• Heuristic spectral techniques for the reduction of bandwidth and work-bound of sparse matrices
• scientific article; zbMATH DE number 4037041 (Why is no real title available?)
• Visualization and Bandwidth Matrix Choice
• Algorithms for reducing the bandwidth and profile of a sparse matrix
• Bandwidth reduction of rectangular matrices
• A hybrid algorithm for reducing matrix bandwidth
• scientific article; zbMATH DE number 3866470 (Why is no real title available?)
• scientific article; zbMATH DE number 2087086 (Why is no real title available?)
• scientific article; zbMATH DE number 1114254 (Why is no real title available?)

This page was built for publication: Bandwidth reduction in sparse matrices

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