
doi: 10.1002/nme.239
AbstractThe meshless element‐free Galerkin method (EFGM) is considered and compared to the finite‐element method (FEM). In particular, topological aspects of meshless methods as the nodal connectivity and invertibility of matrices are studied and compared to those of the FE method. We define four associated graphs for meshless discretizations of EFGM and investigate their connectivity. The ways that the associated graphs for coupled FE‐EFG models might be defined are recommended. The associated graphs are used for nodal ordering of meshless models in order to reduce the bandwidth, profile, maximum frontwidth, and root‐mean‐square wavefront of the corresponding matrices. Finally, the associated graphs are numerically compared. Copyright © 2001 John Wiley & Sons, Ltd.
meshless methods, Finite element methods applied to problems in solid mechanics, graph theory, nodal ordering, Other numerical methods in solid mechanics
meshless methods, Finite element methods applied to problems in solid mechanics, graph theory, nodal ordering, Other numerical methods in solid mechanics
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 4 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
