A Performance Comparison of Continuous and Discontinuous Galerkin Methods with Fast Multigrid Solvers (Q4691180): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Created claim: Wikidata QID (P12): Q129099881, #quickstatements; #temporary_batch_1723938276269 |
||
| (One intermediate revision by one other user not shown) | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W3103023519 / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q129099881 / rank | |||
Normal rank | |||
Latest revision as of 00:59, 18 August 2024
scientific article; zbMATH DE number 6958611
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Performance Comparison of Continuous and Discontinuous Galerkin Methods with Fast Multigrid Solvers |
scientific article; zbMATH DE number 6958611 |
Statements
A Performance Comparison of Continuous and Discontinuous Galerkin Methods with Fast Multigrid Solvers (English)
0 references
19 October 2018
0 references
high-order finite elements
0 references
discontinuous Galerkin method
0 references
hybridizable discontinuous Galerkin
0 references
multigrid method
0 references
matrix-free method
0 references
high-performance computing
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
