Ordering for bandwidth reduction

DOI10.1016/0045-7949(86)90318-4zbMATH Open0601.73095OpenAlexW1982076578MaRDI QIDQ3736993FDOQ3736993

Authors: A. Kaveh 

Publication date: 1986

Published in: Computers & Structures (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0045-7949(86)90318-4

Recommendations

• Bandwidth reduction of rectangular matrices
• scientific article; zbMATH DE number 3930237
• A new mode renumbering algorithm for bandwidth reduction
• A hybrid algorithm for reducing matrix bandwidth
• Nodal ordering for bandwidth reduction using ant system algorithm

zbMATH Keywords

algorithmsstiffnessgraph modelsbandwidth reductiongeneralized cycleshortest route treestwo-step approachnodal orderingflexibility matricesnodal numberingbandwith minimizationordering the elements of cocyclepattern equivalence of strutural and graph-theoretical matricesstarting node

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Trees (05C05) Optimization problems in solid mechanics (74P99)

Cited In (11)

• Nodal ordering for bandwidth reduction using ant system algorithm
• A bandwidth reduction algorithm for L-shaped and Z-shaped grid structured graphs
• Graph transformations for efficient structural analysis
• Suboptimal cycle bases of graphs for the flexibility analysis of skeletal structures
• Topological aspects of meshless methods and nodal ordering for meshless discretizations.
• Bandwidth reduction of rectangular matrices
• An alternative pseudoperipheral node finder for resequencing schemes
• Finite element nodal ordering algorithms
• Title not available (Why is that?)
• A new node renumbering algorithm for bandwidth reduction
• A connectivity coordinate system for node and element ordering

This page was built for publication: Ordering for bandwidth reduction

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