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 profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/nme.1620370907 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2084175071 / rank | |||
Normal rank | |||
Revision as of 20:29, 19 March 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
