Editing Band matrix (section)

==Band form of sparse matrices==
From a computational point of view, working with band matrices is always preferential to working with similarly dimensioned [[square matrices]]. A band matrix can be likened in complexity to a rectangular matrix whose row dimension is equal to the bandwidth of the band matrix. Thus the work involved in performing operations such as multiplication falls significantly, often leading to huge savings in terms of calculation time and [[calculation complexity|complexity]].

As sparse matrices lend themselves to more efficient computation than dense matrices, as well as in more efficient utilization of computer storage,  there has been much research focused on finding ways to minimise the bandwidth (or directly minimise the fill-in) by applying permutations to the matrix, or other such equivalence or similarity transformations.{{sfn|Davis|2006|loc=§7.7}}

The [[Cuthill–McKee algorithm]] can be used to reduce the bandwidth of a sparse [[symmetric matrix]].  There are, however, matrices for which the [[reverse Cuthill–McKee algorithm]] performs better. There are many other methods in use.

The problem of finding a representation of a matrix with minimal bandwidth by means of permutations of rows and columns is [[NP-hard]].{{sfn|Feige|2000}}