Título:
|
Efficiency of high-order elements for continuous and discontinuous Galerkin methods
|
Autor/a:
|
Huerta, Antonio; Angeloski, Aleksandar; Roca Navarro, Francisco Javier; Peraire Guitart, Jaume
|
Otros autores:
|
Universitat Politècnica de Catalunya. Departament d'Enginyeria Civil i Ambiental; Universitat Politècnica de Catalunya. LACÀN - Mètodes Numèrics en Ciències Aplicades i Enginyeria |
Abstract:
|
To evaluate the computational performance of high-order elements, a comparison based on operation count is proposed instead of runtime comparisons. More specifically, linear versus high-order approximations are analyzed for implicit solver under a standard set of hypotheses for the mesh and the solution. Continuous and discontinuous Galerkin methods are considered in two-dimensional and three-dimensional domains for simplices and parallelotopes. Moreover, both element-wise and global operations arising from different Galerkin approaches are studied. The operation count estimates show, that for implicit solvers, high-order methods are more efficient than linear ones. |
Abstract:
|
Peer Reviewed |
Materia(s):
|
-Àrees temàtiques de la UPC::Matemàtiques i estadística::Matemàtica discreta::Combinatòria -Graph theory -high-order elements -efficiency -work estimates -computational cost -Grafs, Teoria de -Classificació AMS::05 Combinatorics::05C Graph theory |
Derechos:
|
|
Tipo de documento:
|
Artículo - Versión presentada Artículo |
Editor:
|
John Wiley & sons
|
Compartir:
|
|