A new mode renumbering algorithm for bandwidth reduction

DOI10.1002/NME.1620230909zbMATH Open0609.65027OpenAlexW4243414153MaRDI QIDQ3750035FDOQ3750035

P. K. F. Lai, I. W. Burgess

Publication date: 1986

Published in: International Journal for Numerical Methods in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nme.1620230909

Recommendations

• Basis of an improved hybrid node renumbering algorithm for matrix bandwidth reduction
• scientific article
• A new matrix bandwidth reduction algorithm
• A constructive bandwidth reduction algorithm
• A hybrid algorithm for reducing matrix bandwidth

zbMATH Keywords

bandwidth reductionbandwidth minimizationconnectivity matrixnode renumberingautomatic renumbering

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Planar graphs; geometric and topological aspects of graph theory (05C10)

Cited In (8)

• An evaluation of reordering algorithms to reduce the computational cost of the incomplete Cholesky-conjugate gradient method
• Title not available (Why is that?)
• An evaluation of low-cost heuristics for matrix bandwidth and profile reductions
• Basis of an improved hybrid node renumbering algorithm for matrix bandwidth reduction
• A general strategy on the bandwidth minimization (BM) problem
• Title not available (Why is that?)
• Ordering for bandwidth reduction
• A new node renumbering algorithm for bandwidth reduction

This page was built for publication: A new mode renumbering algorithm for bandwidth reduction

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