This paper compares and analyzes six algorithms which have been suggested recently for use in reducing, by permutations, the bandwidth and profile of sparse matrices. This problem arises in many different areas of scientific computation such as in the finite element method for approximating solutions of partial differential equations and in analyzing large-scale power transmission systems.
No takes yet. Share an insight, caveat, or question.
Gibbs et al. (1976) studied this question.
Synapse has enriched 4 closely related papers on similar clinical questions. Consider them for comparative context: