Comparative Analysis of the Cuthill–McKee and the Reverse Cuthill–McKee Ordering Algorithms for Sparse Matrices

Direct numerical methods for linear systems and matrix inversion (65F05) General topics in the theory of software (68N01) Algorithms in computer science (68W99)

Cited In (37)

Reordering and incomplete preconditioning in serial and parallel adaptive mesh refinement and coarsening flow solutions
Sparse matrix factor modification in structural reanalysis
The optimization algorithms of network node relabeling for large finite elements program system
A survey of direct methods for sparse linear systems
Numerical linear algebra algorithms and software
Parallel preconditioned conjugate-gradient type algorithms for general sparsity structures
Factorization of saddle-point matrices in dynamical systems optimization -- reusing pivots
Sparsity preserving optimal control of discretized PDE systems
Two improved algorithms for envelope and wavefront reduction
Preconditioner updates for solving sequences of linear systems in matrix-free environment
Topological Bandwidth
A tearing-based hybrid parallel banded linear system solver
Advances in trust region algorithms for constrained optimization
A general finite element preconditioning for the conjugate gradient method
Dynamics of pivoting electrical waves in a cardiac tissue model
Truncated envelope peconditioning technique
An algebraic multilevel parallelizable preconditioner for large-scale CFD problems
Parallel adaptive simulation of gravity currents on the lock-exchange problem
Numerical and physical instabilities in massively parallel LES of reacting flows
A tearing-based hybrid parallel sparse linear system solver
Basis of an improved hybrid node renumbering algorithm for matrix bandwidth reduction
EVALUATION OF AUTOMATIC DOMAIN PARTITIONING ALGORITHMS FOR PARALLEL FINITE ELEMENT ANALYSIS
Sparse grids for the Schrödinger equation
Algorithms for the reduction of matrix bandwidth and profile
Bandwidth and profile minimization
Title not available (Why is that?)
Addressing the envelope reduction of sparse matrices using a genetic programming system
Bandwidth Minimization: An approximation algorithm for caterpillars
On some properties of the Laplacian matrix revealed by the RCM algorithm
Solution of sparse positive definite systems on a hypercube
Optimal block-tridiagonalization of matrices for coherent charge transport
State-of-the-Art Sparse Direct Solvers
Solving systems of elastic bar structures by preconditioned conjugate gradient method
Method of fundamental solutions for 3D elasticity with body forces by coupling compactly supported radial basis functions
The Bandwidth Minimization Problem for Caterpillars with Hair Length 3 is NP-Complete
A Jacobian-free Newton-Krylov algorithm for compressible turbulent fluid flows
Combinatorial Aspects in Sparse Elimination Methods

This page was built for publication: Comparative Analysis of the Cuthill–McKee and the Reverse Cuthill–McKee Ordering Algorithms for Sparse Matrices

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