Node and element resequencing using the Laplacian of a finite element graph: Part I—General concepts and algorithm (Q4305040): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: symrcm / rank | |||
Normal rank | |||
Revision as of 12:48, 29 February 2024
scientific article; zbMATH DE number 633768
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
