Internally funded project
Start date : 16.03.2012
End date : 15.03.2018
We consider local refinements of finite element triangulations as continuous graph operations, for instance by splitting nodes and inflating edges to elements. This approach allows for the derivation of sensitivities for functionals depending on the finite element solution, which may in turn be used to define local refinement indicators. Thereby, we develop adaptive algorithms exploiting sensitivities for both hierarchical and non-hierarchical mesh changes, and analyze their properties and performance in comparison with established methods.
We consider local refinements of finite element triangulations as continuous graph operations, for instance by splitting nodes and inflating edges to elements. This approach allows for the derivation of sensitivities for functionals depending on the finite element solution, which may in turn be used to define local refinement indicators. Thereby, we develop adaptive algorithms exploiting sensitivities for both hierarchical and non-hierarchical mesh changes, and analyze their properties and performance in comparison with established methods.