Domain decomposition like technique with \(H/h\)-independent rate of convergence (Q1917852)

The authors present a two-level algorithm for solving a discrete variational problem \[ a(u,v)= f(v)\text{ for all }v\in V_h\subseteq H^1_0(\Omega), \] where \(V_h\) is a piecewise linear finite element space. For smoothing of the prolongation operator they use Tchebyshev-like polynomials and assert a convergence rate independent of \(H/h\), the parameters of the joined grids. The paper is a draft of an unpublished but submitted paper. All proofs can be found therein.