Note on minimizing the bandwidth of sparse, symmetric matrices

DOI10.1007/BF02239468MaRDI QIDQ2559235zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 1973

Published in Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02239468

Mathematics Subject Classification ID

Cites work

• Minimizing the bandwidth of sparse symmetric matrices

Cited in

(9)

• Computational methods of linear algebra
• The NP-completeness of the bandwidth minimization problem
• Bandwidth and pebbling
• A general strategy on the bandwidth minimization (BM) problem
• A bandwidth reduction algorithm for L-shaped and Z-shaped grid structured graphs
• A new algorithm for finding a pseudoperipheral vertex or the endpoints of a pseudodiameter in a graph
• Finite element nodal ordering algorithms
• Nodal ordering for bandwidth reduction using ant system algorithm
• A survey of direct methods for sparse linear systems

This page was built for publication: Note on minimizing the bandwidth of sparse, symmetric matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2559235)