A Comparison of Several Bandwidth and Profile Reduction Algorithms

DOI10.1145/355705.355707zbMath0345.65014DBLPjournals/toms/GibbsPS76OpenAlexW1994371611WikidataQ56227992 ScholiaQ56227992MaRDI QIDQ4114693

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)

Related Items (14)

Automated mesh decomposition and concurrent finite element analysis for hypercube multiprocessor computers ⋮ Adapting and optimising fluidity for high-fidelity coastal modelling ⋮ Heuristics for matrix bandwidth reduction ⋮ Parallel preconditioned conjugate-gradient type algorithms for general sparsity structures ⋮ An interior-point implementation developed and tuned for radiation therapy treatment planning ⋮ Finite element nodal ordering algorithms ⋮ GRASP and path relinking for the matrix bandwidth minimization. ⋮ On bandwidth, cutwidth, and quotient graphs ⋮ 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. ⋮ Parallel symmetric sparse matrix-vector product on scalar multi-core CPUs ⋮ An evaluation of low-cost heuristics for matrix bandwidth and profile reductions ⋮ Bibliography on the evaluation of numerical software

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