Domain decomposition like technique with H/h-independent rate of convergence

A two-level algorithm for unstructured meshes with a coarse-space size independent rate of convergence is developed based on polynomial smoothing of prolongators given by unknowns aggregation. A coarse level is generated algebraically using a system of possibly large subdomains. Numerical experiments confirm the theory and demonstrate that the method performs well also on a general class of problems.