1976•SIAM Journal on Numerical AnalysisRequires access

An Algorithm for Reducing the Bandwidth and Profile of a Sparse Matrix

Norman E. Gibbs, William G. Poole, Paul K. Stockmeyer

Abstract

A new algorithm for reducing the bandwidth and profile of a sparse matrix is described. Extensive testing on finite element matrices indicates that the algorithm typically produces bandwidth and profile which are comparable to those of the commonly-used reverse Cuthill–McKee algorithm, yet requires significantly less computation time.

About this research paper

What this paper is about

Why it matters

OpenAlex reports 592 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Algorithm, Computation, Sparse matrix, Bandwidth (computing), Cuthill–McKee algorithm, Matrix (chemical analysis), Finite element method, Mathematics