Finite element nodal ordering algorithms

DOI10.1002/cnm.1640111205zbMath1018.74528OpenAlexW2106998845MaRDI QIDQ4868052

S. M. R. Behfar, Ali Kaveh

Publication date: 3 September 2003

Published in: Communications in Numerical Methods in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/cnm.1640111205

Mathematics Subject Classification ID

Finite element methods applied to problems in solid mechanics (74S05) Graph theory (05C99)

Related Items

Assembling sparse matrices in MATLAB, Topological aspects of meshless methods and nodal ordering for meshless discretizations

Cites Work

• Note on minimizing the bandwidth of sparse, symmetric matrices
• A New Algorithm for Finding a Pseudoperipheral Node in a Graph
• An algorithm for profile and wavefront reduction of sparse matrices
• Ordering for bandwidth reduction
• Cycle bases for the flexibility analysis of structures
• An Algorithm for Reducing the Bandwidth and Profile of a Sparse Matrix
• A Comparison of Several Bandwidth and Profile Reduction Algorithms
• A two‐step approach to finite element ordering