A comparasion of three resequencing algorithms for the reduction of matrix profile and wavefront

DOI10.1002/nme.1620140606zbMath0401.73082OpenAlexW2016986828MaRDI QIDQ4185935

Gordon C. Everstine

Publication date: 1979

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.1620140606

zbMATH Keywords

WavefrontCuthill-MckeeFinite Element Computer ProgramGibBs-Poole-StockmeyerMatrix ProfileResequencing Algorithm

Mathematics Subject Classification ID

Finite element methods applied to problems in solid mechanics (74S05) Software, source code, etc. for problems pertaining to mechanics of deformable solids (74-04)

Related Items

Profile minimization problem for matrices and graphs ⋮ Unnamed Item ⋮ A note on direct methods for approximations of sparse Hessian matrices ⋮ A parallel graph partitioning algorithm for a message-passing multiprocessor ⋮ Basis of an improved hybrid node renumbering algorithm for matrix bandwidth reduction ⋮ A new algorithm for finding a pseudoperipheral vertex or the endpoints of a pseudodiameter in a graph ⋮ Bandwidth and profile minimization ⋮ Unnamed Item ⋮ A survey of direct methods for sparse linear systems ⋮ Software for estimating sparse Jacobian matrices ⋮ A direct active set algorithm for large sparse quadratic programs with simple bounds ⋮ An evaluation of low-cost heuristics for matrix bandwidth and profile reductions ⋮ A chordal preconditioner for large-scale optimization ⋮ Estimation of sparse hessian matrices and graph coloring problems ⋮ Addressing the envelope reduction of sparse matrices using a genetic programming system

Uses Software

• symrcm