Article ID Journal Published Year Pages File Type
6928604 Journal of Computational Physics 2018 27 Pages PDF
Abstract
In contrast, the method proposed here is independent of the discretization technique (e.g., collocation, Galerkin). Furthermore, it completely remeshes at each refinement step, altering the shape, size, and orientation of each element according to an optimal metric based on a numerically recovered Hessian of the boundary solution. The resulting adaptation procedure is truly anisotropic and independent of the complexity of the geometry. We show via a variety of numerical examples that it recovers optimal convergence rates for domains with geometric singularities. In particular, a faster convergence rate is recovered for scattering problems with complex geometries.
Related Topics
Physical Sciences and Engineering Computer Science Computer Science Applications
Authors
, , ,