A new mode renumbering algorithm for bandwidth reduction

DOI10.1002/NME.1620230909MaRDI QIDQ3750035zbMATH OpenOpenAlexFDO

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

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

zbMATH Keywords

automatic renumberingbandwidth minimizationbandwidth reductionconnectivity matrixnode renumbering

Mathematics Subject Classification ID

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

Recommendations

• Basis of an improved hybrid node renumbering algorithm for matrix bandwidth reduction
• scientific article; zbMATH DE number 4037041
• A new matrix bandwidth reduction algorithm
• A constructive bandwidth reduction algorithm
• A hybrid algorithm for reducing matrix bandwidth

Cited in

(9)

• Basis of an improved hybrid node renumbering algorithm for matrix bandwidth reduction
• An evaluation of reordering algorithms to reduce the computational cost of the incomplete Cholesky-conjugate gradient method
• scientific article; zbMATH DE number 4134066 (Why is no real title available?)
• A general strategy on the bandwidth minimization (BM) problem
• scientific article; zbMATH DE number 3930237 (Why is no real title available?)
• Ordering for bandwidth reduction
• A new node renumbering algorithm for bandwidth reduction
• scientific article; zbMATH DE number 975329 (Why is no real title available?)
• An evaluation of low-cost heuristics for matrix bandwidth and profile reductions

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)