A two‐step approach to finite element ordering

DOI10.1002/NME.1620190610MaRDI QIDQ4747686zbMATHOpenAlexFDO

Authors Steven J. Fenves, Kincho H. Law

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)

Cites work

• scientific article; zbMATH DE number 3816913 (Why is no real title available?)
• scientific article; zbMATH DE number 3001191 (Why is no real title available?)
• An Algorithm for Reducing the Bandwidth and Profile of a Sparse Matrix

Cited in

(9)

• A survey of direct methods for sparse linear systems
• scientific article; zbMATH DE number 1062852 (Why is no real title available?)
• Finite element nodal ordering algorithms
• A bandwidth reduction algorithm for L-shaped and Z-shaped grid structured graphs
• Topological aspects of meshless methods and nodal ordering for meshless discretizations.
• Recursive spectral algorithms for automatic domain partitioning in parallel finite element analysis
• An evaluation of low-cost heuristics for matrix bandwidth and profile reductions
• A new algorithm for finding a pseudoperipheral vertex or the endpoints of a pseudodiameter in a graph
• A new approach to minimising the frontwidth in finite element calculations

Describes a project that uses

Uses Software

• symrcm
• YSMP

This page was built for publication: A two‐step approach to finite element ordering

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