The bandwidth in this convention is the largest distance from the main diagonal of a nonzero matrix entry. A symmetric positive-definite matrix of bandwidth can be factored using operations and storage; its Cholesky decomposition does not introduce entries outside that band. A variable permutation changes bandwidth, so it is a property of both the sparsity pattern and its ordering.
New to topics? Read the docs here!