Alternate strip-based substructuring algorithms for elliptic PDEs in two dimensions

^** Email: angela.mihai{at}strath.ac.uk^*** Email: alan.craig{at}durham.ac.uk The alternate strip-based substructuring algorithms are efficientpreconditioning techniques for the discrete systems which arisefrom the finite-element approximation of symmetric ellipticboundary-value problems in 2D Euclidean spaces. The new approachis based on alternate decomposition of the given domain intoa finite number of strips. Each strip is a union of non-overlappingsubdomains and the global interface between subdomains is partitionedas a union of edges between strips and edges between subdomainsthat belong to the same strip. Both scalability and efficiencyare achieved by alternating the direction of the strips. Thisapproach generates algorithms in two stages and allows the useof a two-grid V cycle. Numerical estimates illustrate the behaviourof the new domain decomposition techniques.