A linear time implementation of the reverse Cuthill-McKee algorithm

DOI10.1007/BF01933580zbMath0436.65021MaRDI QIDQ3876923

No author found.

Publication date: 1980

Published in: BIT (Search for Journal in Brave)

zbMATH Keywords

numerical experiments; reverse Cuthill-McKee algorithm; reordering a sparse matrix; small envelope

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

65F35: Numerical computation of matrix norms, conditioning, scaling

Related Items

The Augmented Block Cimmino Distributed Method, A survey of direct methods for sparse linear systems, A fast method for solving acoustic scattering problems in frequency bands, Parallel dynamic load balancing strategies for adaptive irregular applications, State-defect constraint pairing graph coarsening method for Karush-Kuhn-Tucker matrices arising in orthogonal collocation methods for optimal control, Mesh partitioning algorithms for the parallel solution of partial differential equations, Limited-memory LDL\(^{\top}\) factorization of symmetric quasi-definite matrices with application to constrained optimization, The second generation FETI methods and their application to the parallel solution of large-scale linear and geometrically non-linear structural analysis problems, A Task-Scheduling Approach for Efficient Sparse Symmetric Matrix-Vector Multiplication on a GPU, Unnamed Item

Uses Software

• symrcm

Cites Work

• Unnamed Item
• Unnamed Item
• An Implementation of a Pseudoperipheral Node Finder
• An Algorithm for Reducing the Bandwidth and Profile of a Sparse Matrix
• Algorithms for Matrix Partitioning and the Numerical Solution of Finite Element Systems