Basis of an improved hybrid node renumbering algorithm for matrix bandwidth reduction
From MaRDI portal
Publication:1913169
DOI10.1016/0045-7825(94)90005-1zbMath0847.65027OpenAlexW2013203104MaRDI QIDQ1913169
Ray P. S. Han, Douglas G. Scott
Publication date: 11 July 1996
Published in: Computer Methods in Applied Mechanics and Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0045-7825(94)90005-1
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Uses Software
Cites Work
- Unnamed Item
- Minimizing the bandwidth of sparse symmetric matrices
- A hybrid algorithm for reducing matrix bandwidth
- Simple and effective bandwidth reduction algorithm
- A new mode renumbering algorithm for bandwidth reduction
- An Algorithm for Reducing the Bandwidth and Profile of a Sparse Matrix
- Comparative Analysis of the Cuthill–McKee and the Reverse Cuthill–McKee Ordering Algorithms for Sparse Matrices
- A comparasion of three resequencing algorithms for the reduction of matrix profile and wavefront
- Object oriented matrix classes for use in a finite element code using C++
This page was built for publication: Basis of an improved hybrid node renumbering algorithm for matrix bandwidth reduction
