Machine learning based refinement strategies for polyhedral grids with applications to virtual element and polyhedral discontinuous Galerkin methods (Q2675603)
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: Machine learning based refinement strategies for polyhedral grids with applications to virtual element and polyhedral discontinuous Galerkin methods |
scientific article; zbMATH DE number 7592135
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Machine learning based refinement strategies for polyhedral grids with applications to virtual element and polyhedral discontinuous Galerkin methods |
scientific article; zbMATH DE number 7592135 |
Statements
Machine learning based refinement strategies for polyhedral grids with applications to virtual element and polyhedral discontinuous Galerkin methods (English)
0 references
24 September 2022
0 references
polyhedral grid refinement
0 references
machine learning
0 references
convolutional neural networks
0 references
\(k\)-means
0 references
polyhedral discontinuous Galerkin
0 references
virtual element method
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.87634796
0 references
0.8520553
0 references
0.8518702
0 references
0.8493618
0 references
0.84341115
0 references
0.8433875
0 references
0.8416833
0 references
0.84001666
0 references
0.83834356
0 references
