Node and element resequencing using the Laplacian of a finite element graph: Part I—General concepts and algorithm
From MaRDI portal
Publication:4305040
DOI10.1002/nme.1620370907zbMath0805.73065OpenAlexW2084175071MaRDI QIDQ4305040
Ivan F. M. Menezes, Marcelo Gattass, Glaucio H. Paulino, Subrata Mukherjee
Publication date: 10 October 1994
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.1620370907
Graph theory (including graph drawing) in computer science (68R10) Finite element methods applied to problems in solid mechanics (74S05) Thin bodies, structures (74K99)
Related Items
Topology and graph products; eigenproblems in optimal structural analysis, A variable neighborhood search and simulated annealing hybrid for the profile minimization problem, Two improved algorithms for envelope and wavefront reduction, \texttt{PolyMesher}: a general-purpose mesh generator for polygonal elements written in Matlab, Phase-field based topology optimization with polygonal elements: a finite volume approach for the evolution equation, 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, Geometric learning for computational mechanics. III: Physics-constrained response surface of geometrically nonlinear shells, Eigensolution of Laplacian matrices for graph partitioning and domain decomposition, Polygonal finite elements for topology optimization: A unifying paradigm, Unnamed Item, Finite element mesh decomposition using complementary Laplacian matrix, A novel nodal ordering algorithm for profile optimization by efficient solution of a differential equation, Combinatorial optimization of special graphs for nodal ordering and graph partitioning, Unnamed Item
Uses Software
Cites Work
