<abstract xmlns="http://www.w3.org/1999/xhtml"><p> This paper proposes two methods for determining suit- able interchanges of lines/columns in case of average bandwidth re- duction in sparse and symmetric matrices. First, a greedy heuristic inspired by the laws of physics (mechanics) to reduce the average bandwidth is proposed. The second method is an exact method that allows to estimate the potential of a row/column interchange to reduce the average bandwidth.</p></abstract>

This paper proposes two methods for determining suit- able interchanges of lines/columns in case of average bandwidth re- duction in sparse and symmetric matrices. First, a greedy heuristic inspired by the laws of physics (mechanics) to reduce the average bandwidth is proposed. The second method is an exact method that allows to estimate the potential of a row/column interchange to reduce the average bandwidth.

Interchange Opportunity in Average Bandwidth Reduction in Sparse Matrices

Department of Computer Science University of Timisoara

Annals of West University of Timisoara - Mathematics and Computer Science

{"article-title":"Interchange Opportunity in Average Bandwidth Reduction in Sparse Matrices"}

This paper proposes two methods for determining suit- able interchanges of lines/columns in case of average bandwidth re- duction in sparse and symmetric...

Interchange Opportunity in Average Bandwidth Reduction in Sparse Matrices

Pubblicato online: 15 gen 2013

Pagine: 55 - 66

DOI: https://doi.org/10.2478/v10324-012-0015-2

This content is open access.