Vorträge und Posterpräsentationen (ohne Tagungsband-Eintrag):
S. Ferraz-Leite, C. Ortner, D. Praetorius:
"Convergence of h-h/2 based adaptive Galerkin schemes";
Vortrag: 5th Austrian Numerical Analysis Day,
Innsbruck;
07.05.2009
- 08.05.2009.
Kurzfassung englisch:
Let H be a real Hilbert space with scalar product <.,.> and
associated energy norm ||.||. Given a right-hand side F in H*,
we aim at a numerical approximation of the unique solution u in H of
<u,v> = F(v) for all v in H.
To that end, let Xl be a finite-dimensional subspace of H,
which in usual applications is based on a triangulation. Let ul in Xl be the corresponding Galerkin
solution, obtained by solving the finite-dimensional linear system
<ul,vl> = F(vl) for all vl in Xl.
Throughout, the index l = {0, 1, 2, ...} denotes the
step of an adaptive algorithm.
We say that such an algorithm is convergent if, and
only if, ul tends to u as l tends to infinity.
We prove that the saturation assumption yields convergence of
an adaptive algorithm based on the h-h/2-error estimator.
Besides the adaptive finite element method (AFEM), our argument
applies to boundary integral formulations and yields a first
convergence proof for the adaptive boundary element method (ABEM).
Schlagworte:
adaptive algorithm, BEM, FEM, convergence, Galerkin method
Elektronische Version der Publikation:
http://publik.tuwien.ac.at/files/PubDat_175483.pdf
Erstellt aus der Publikationsdatenbank der Technischen Universität Wien.