Reducing the Total Bandwidth of a Sparse Unsymmetric Matrix
From MaRDI portal
Publication:5296016
DOI10.1137/050629938zbMATH Open1123.65027OpenAlexW2083873045MaRDI QIDQ5296016FDOQ5296016
Authors: J. K. Reid, J. A. Scott 
Publication date: 31 July 2007
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/df027b6190ab216609481fd2aabc7081eaddacee
Recommendations
Gaussian eliminationnumerical resultsbandwidth reductionmatrix bandwidthCuthill-McKee algorithmsparse unsymmetric matrices
Cited In (15)
- Reducing the bandwidth of a sparse matrix with tabu search.
- Heuristic spectral techniques for the reduction of bandwidth and work-bound of sparse matrices
- Adjacency-based, non-intrusive model reduction for vortex-induced vibrations
- Generalised latent assimilation in heterogeneous reduced spaces with machine learning surrogate models
- Title not available (Why is that?)
- Title not available (Why is that?)
- Level-based heuristics and hill climbing for the antibandwidth maximization problem
- On exploiting sparsity of multiple right-hand sides in sparse direct solvers
- An evaluation of low-cost heuristics for matrix bandwidth and profile reductions
- On some properties of the Laplacian matrix revealed by the RCM algorithm.
- Algorithms for reducing the bandwidth and profile of a sparse matrix
- Bandwidth reduction of rectangular matrices
- Analysis of Probing Techniques for Sparse Approximation and Trace Estimation of Decaying Matrix Functions
- A hybrid algorithm for reducing matrix bandwidth
- Title not available (Why is that?)
Uses Software
This page was built for publication: Reducing the Total Bandwidth of a Sparse Unsymmetric Matrix
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5296016)
