Node and element resequencing using the Laplacian of a finite element graph: Part I—General concepts and algorithm (Q4305040)

From MaRDI portal
Revision as of 22:13, 27 October 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    0 references
    0 references
    0 references
    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

    Identifiers

    0 references
    0 references
    0 references
    0 references