A hybrid algorithm for reducing matrix bandwidth

DOI10.1002/nme.1620201012zbMath0548.65023OpenAlexW2056437596MaRDI QIDQ3340028

Bruce A. Armstrong

Publication date: 1984

Published in: International Journal for Numerical Methods in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nme.1620201012

zbMATH Keywords

finite elementbenchmark problemssymmetric matricesbandwidth reductionhybrid algorithmCuthill-McKeeGibbs-Poole-Stockmeyernode-shuffling algorithm

Mathematics Subject Classification ID

Finite element methods applied to problems in solid mechanics (74S05) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30)

Related Items (1)

Basis of an improved hybrid node renumbering algorithm for matrix bandwidth reduction

Cites Work

• An Algorithm for Reducing the Bandwidth and Profile of a Sparse Matrix
• Sparse matrices

This page was built for publication: A hybrid algorithm for reducing matrix bandwidth