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 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.
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.
Read more about this topic: Band Matrix
Famous quotes containing the words band, form and/or sparse:
“There was a young lady called Gloria
Who was had by Sir Gerald Du Maurier
And then by six men
And Sir Gerald again
And the band of the Waldorf-Astoria.”
—Anonymous.
“I find in most novels no imagination at all. They seem to think the highest form of the novel is to write about marriage, because that’s the most important thing there is for middle-class people.”
—Gore Vidal (b. 1925)
“The report reflects incredibly terrible judgments, shockingly sparse concern for human life, instances of officials lacking the courage to exercise the responsibilities of their high office and some very bewildering thought processes.”
—Jane Jarrell Smith, U.S. widow of American astronaut Michael J. Smith. As quoted in Newsweek magazine, p. 13 (June 30, 1986)