z-logo
open-access-imgOpen Access
Computing the Distance between Two Finite Element Solutions Defined on Different 3D Meshes on a GPU
Author(s) -
Maxence Reberol,
Bruno Lévy
Publication year - 2018
Publication title -
siam journal on scientific computing
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.674
H-Index - 147
eISSN - 1095-7197
pISSN - 1064-8275
DOI - 10.1137/17m1115976
Subject(s) - polygon mesh , finite element method , hexahedron , tetrahedron , computer science , norm (philosophy) , discretization , mathematics , algorithm , mathematical analysis , geometry , physics , political science , law , thermodynamics
This article introduces a new method to efficiently compute the distance (i.e., $L^p$ norm of the difference) between two functions supported by two different meshes of the same 3D domain. The functions that we consider are typically finite element solutions discretized in different function spaces supported by meshes that are potentially completely unrelated. Our method computes an approximation of the distance by resampling both fields over a set of parallel 2D regular grids. By leveraging the parallel horse power of computer graphics hardware (graphics processing unit (GPU)), our method can efficiently compute distances between meshes with multimillion elements in seconds. We demonstrate our method applied to different problems (distance between known functions, Poisson solutions, and linear elasticity solutions) using different function spaces (Lagrange polynomials from order one to seven) and different meshes (tetrahedral and hexahedral, with linear or quadratic geometry).

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom