Longest-edge \(n\)-section algorithms: properties and open problems (Q747921)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Longest-edge \(n\)-section algorithms: properties and open problems |
scientific article; zbMATH DE number 6496054
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Longest-edge \(n\)-section algorithms: properties and open problems |
scientific article; zbMATH DE number 6496054 |
Statements
Longest-edge \(n\)-section algorithms: properties and open problems (English)
0 references
19 October 2015
0 references
longest-edge \(n\)-section algorithm
0 references
simplicial partition
0 references
angle conditions
0 references
finite element method
0 references
mesh refinement
0 references
mesh regularity
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8672261
0 references
0.86096346
0 references
0.8573098
0 references
0 references
0.8523481
0 references
0.8448061
0 references
0.8446557
0 references
