Implementation of the Gibbs-Poole-Stockmeyer and Gibbs-King Algorithms
From MaRDI portal
Publication:3936105
DOI10.1145/355993.355998zbMath0478.65026OpenAlexW2040270254MaRDI QIDQ3936105
Publication date: 1982
Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/355993.355998
sparse linear systemsbandwidth reductionmatrix bandwidthmatrix profileGibbs-King algorithmGibbs-Pole-Stockmeyer algorithmmatrix wavefront
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (15)
Metaheuristic algorithms for the bandwidth reduction of large-scale matrices ⋮ Unnamed Item ⋮ Automated mesh decomposition and concurrent finite element analysis for hypercube multiprocessor computers ⋮ A non-nested Galerkin multi-grid method for solving linear and nonlinear solid mechanics problems ⋮ Two improved algorithms for envelope and wavefront reduction ⋮ A new algorithm for finding a pseudoperipheral vertex or the endpoints of a pseudodiameter in a graph ⋮ A Hypergraph Partitioning Model for Profile Minimization ⋮ A multi-grid enhanced GMRES algorithm for elasto-plastic problems ⋮ Unnamed Item ⋮ A survey of direct methods for sparse linear systems ⋮ New crash procedures for large systems of linear constraints ⋮ An evaluation of low-cost heuristics for matrix bandwidth and profile reductions ⋮ Strategies for Fitting Large, Geostatistical Data in MCMC Simulation ⋮ Algorithms for the reduction of matrix bandwidth and profile ⋮ Addressing the envelope reduction of sparse matrices using a genetic programming system
This page was built for publication: Implementation of the Gibbs-Poole-Stockmeyer and Gibbs-King Algorithms
