Finite element nodal ordering algorithms

DOI10.1002/CNM.1640111205MaRDI QIDQ4868052zbMATHOpenAlexFDO

Authors S. M. R. Behfar, A. 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)

Cites work

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

Cited in

(2)

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

This page was built for publication: Finite element nodal ordering algorithms

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