Fast compuations with the harmonic Poincaré-Steklov operators on nested refined meshes (Q1381394)

Asymptotically optimal algorithms for the treatment of finite element discretizations to the harmonic interior and exterior Poincaré-Steklov operators on polygons in the presence of a nested mesh refinement near the corners are developed and analyzed. For both interior and exterior problems the proposed technique is shown to have a complexity of order \(O(N_r \log^3 N_u),\) where \(N_r = O((1+p_r)N_u)\) is the number of degrees of freedom on the underlying boundary, \(N_u\) denotes the boundary dimension of the finest quasi-uniform level and \(p_r\geq 0\) means the refinement depth. The corresponding memory needs are estimated by \(O(N_r \log ^q N_u)\), where \( q=2\) or \(q=3\) relate to the interior or exterior problems, respectively. The approach is based on the multilevel interface solver applied to the Schur complement reduction onto the nested refined interface associated with a nonmatching decomposition of the underlying polygon by rectangular substructures. The authors extend their methods [ibid. 4, No. 4, 331-355 (1995; Zbl 0839.65129)] developed for the cases of interior and quasi-uniform meshes.