A comparasion of three resequencing algorithms for the reduction of matrix profile and wavefront
From MaRDI portal
Publication:4185935
DOI10.1002/nme.1620140606zbMath0401.73082MaRDI QIDQ4185935
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
Wavefront; Cuthill-Mckee; Finite Element Computer Program; GibBs-Poole-Stockmeyer; Matrix Profile; Resequencing Algorithm
74S05: Finite element methods applied to problems in solid mechanics
74-04: Software, source code, etc. for problems pertaining to mechanics of deformable solids
Related Items
Unnamed Item, A new algorithm for finding a pseudoperipheral vertex or the endpoints of a pseudodiameter in a graph, A direct active set algorithm for large sparse quadratic programs with simple bounds, A parallel graph partitioning algorithm for a message-passing multiprocessor, A chordal preconditioner for large-scale optimization, Profile minimization problem for matrices and graphs, Basis of an improved hybrid node renumbering algorithm for matrix bandwidth reduction, Unnamed Item, Software for estimating sparse Jacobian matrices, Estimation of sparse hessian matrices and graph coloring problems, Unnamed Item
Uses Software
