A Comparison of Several Bandwidth and Profile Reduction Algorithms

DOI10.1145/355705.355707MaRDI QIDQ4114693zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Norman E. Gibbs, William Poole, Paul K. Stockmeyer

Publication date 1976

Published in ACM Transactions on Mathematical Software (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/355705.355707

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05)

Cited in

(14)

• Automated mesh decomposition and concurrent finite element analysis for hypercube multiprocessor computers
• Bibliography on the evaluation of numerical software
• GRASP and path relinking for the matrix bandwidth minimization.
• Adapting and optimising fluidity for high-fidelity coastal modelling
• An interior-point implementation developed and tuned for radiation therapy treatment planning
• Parallel preconditioned conjugate-gradient type algorithms for general sparsity structures
• On bandwidth, cutwidth, and quotient graphs
• Finite element nodal ordering algorithms
• Sparse approximate inverse preconditioners on high performance GPU platforms
• A survey of direct methods for sparse linear systems
• Reducing the bandwidth of a sparse matrix with tabu search.
• An evaluation of low-cost heuristics for matrix bandwidth and profile reductions
• Heuristics for matrix bandwidth reduction
• Parallel symmetric sparse matrix-vector product on scalar multi-core CPUs

This page was built for publication: A Comparison of Several Bandwidth and Profile Reduction Algorithms

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