A two‐step approach to finite element ordering

DOI10.1002/nme.1620190610zbMath0508.73057OpenAlexW2067199681MaRDI QIDQ4747686

Kincho H. Law, Steven J. Fenves

Publication date: 1983

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

zbMATH Keywords

graph theorysparse matrixfinite element orderingtwo-step approachmore efficient than reverse Cuthill-McKee algorithmperformed by Cuthill-McKee algorithmstructure of finite element mesh

Mathematics Subject Classification ID

Finite element methods applied to problems in solid mechanics (74S05) Numerical and other methods in solid mechanics (74S99)

Related Items

A new approach to minimising the frontwidth in finite element calculations ⋮ Recursive spectral algorithms for automatic domain partitioning in parallel finite element analysis ⋮ A new algorithm for finding a pseudoperipheral vertex or the endpoints of a pseudodiameter in a graph ⋮ A bandwidth reduction algorithm for L-shaped and Z-shaped grid structured graphs ⋮ Finite element nodal ordering algorithms ⋮ A survey of direct methods for sparse linear systems ⋮ Topological aspects of meshless methods and nodal ordering for meshless discretizations ⋮ An evaluation of low-cost heuristics for matrix bandwidth and profile reductions ⋮ Unnamed Item

Uses Software

• symrcm
• YSMP

Cites Work

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