Element partition trees for \(h\)-refined meshes to optimize direct solver performance. I: Dynamic programming (Q2011908)
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: Element partition trees for h-refined meshes to optimize direct solver performance. I: Dynamic programming |
scientific article; zbMATH DE number 6754243
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Element partition trees for \(h\)-refined meshes to optimize direct solver performance. I: Dynamic programming |
scientific article; zbMATH DE number 6754243 |
Statements
Element partition trees for \(h\)-refined meshes to optimize direct solver performance. I: Dynamic programming (English)
0 references
27 July 2017
0 references
\(h\)-adaptive finite element method
0 references
ordering
0 references
element partition tree
0 references
extensions of dynamic programming
0 references
multifrontal direct solvers
0 references
0 references
0 references
0 references
0 references
0 references
0 references
