Bandwidth reduction of rectangular matrices
From MaRDI portal
Recommendations
- Bandwidth reduction in sparse matrices
- A new matrix bandwidth reduction algorithm
- Bandwidth reduction in rectangular grids
- Heuristics for matrix bandwidth reduction
- Algorithms for the reduction of matrix bandwidth and profile
- Reducing the Total Bandwidth of a Sparse Unsymmetric Matrix
- A hybrid algorithm for reducing matrix bandwidth
- Efficient reduction algorithms for bordered band matrices
- scientific article; zbMATH DE number 3888803
- Decreasing the bandwidth of a transition matrix
Cites work
- A Characterization of Total Graphs
- A combinatorial optimization problem: optimal generalized cycle bases
- A connectivity coordinate system for node and element ordering
- A Framework for Equilibrium Equations
- On computational procedures for the force method
- Ordering for bandwidth reduction
- Suboptimal cycle bases of graphs for the flexibility analysis of skeletal structures
Cited in
(9)- Graph transformations for efficient structural analysis
- Sparse self-stress matrices for the finite element force method
- Visualization and Bandwidth Matrix Choice
- scientific article; zbMATH DE number 3866470 (Why is no real title available?)
- scientific article; zbMATH DE number 4157776 (Why is no real title available?)
- Bandwidth reduction in rectangular grids
- Ordering for bandwidth reduction
- A bandwidth reduction algorithm for L-shaped and Z-shaped grid structured graphs
- Nodal ordering for bandwidth reduction using ant system algorithm
This page was built for publication: Bandwidth reduction of rectangular matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3136817)
