Reducing the Total Bandwidth of a Sparse Unsymmetric Matrix
From MaRDI portal
Publication:5296016
DOI10.1137/050629938zbMath1123.65027OpenAlexW2083873045MaRDI QIDQ5296016
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
numerical resultsGaussian eliminationbandwidth reductionmatrix bandwidthCuthill-McKee algorithmsparse unsymmetric matrices
Related Items
On Exploiting Sparsity of Multiple Right-Hand Sides in Sparse Direct Solvers, An evaluation of low-cost heuristics for matrix bandwidth and profile reductions, Analysis of Probing Techniques for Sparse Approximation and Trace Estimation of Decaying Matrix Functions, On some properties of the Laplacian matrix revealed by the RCM algorithm, Level-based heuristics and hill climbing for the antibandwidth maximization problem, Generalised latent assimilation in heterogeneous reduced spaces with machine learning surrogate models
Uses Software