Node and element resequencing using the Laplacian of a finite element graph: Part I—General concepts and algorithm (Q4305040)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 633768
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Node and element resequencing using the Laplacian of a finite element graph: Part I—General concepts and algorithm |
scientific article; zbMATH DE number 633768 |
Statements
Node and element resequencing using the Laplacian of a finite element graph: Part I—General concepts and algorithm (English)
0 references
10 October 1994
0 references
graph representation
0 references
nodal graph
0 references
dual graph
0 references
associated finite element mesh
0 references
0.8339868783950806
0 references
0.7754566073417664
0 references
0.7690638303756714
0 references
0.7536019682884216
0 references
