“…These solvers do not have optimal complexity (they typically require O(N 3/2 ) for the factorization stage in 2D, and O(N 2 ) in 3D), but are nevertheless popular (especially in 2D) due in part to their robustness, and in part to the unrivaled speed that can be attained for problems involving multiple right hand sides. Very recently, it has been demonstrated that by exploiting structured matrix algebra (such as, e.g., H-matrices, or HSS matrices), to manipulate the dense matrices that arise due to fill-in, direct solvers of linear or close to linear complexity can be constructed [17,28,30,35,40]. The direct solver described in this paper is conceptually similar to these algorithms in that they all rely on hierarchical domain decompositions, and efficient representations of operators that live on the interfaces between sub-domains.…”