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
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q4004085 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3664299 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3707286 / rank | |||
Normal rank | |||
Latest revision as of 16:39, 22 May 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
