A relaxation procedure for domain decomposition methods using finite elements (Q1113632): Difference between revisions

We present the convergence analysis of a new domain decomposition technique for finite element approximations. This technique is based on an iterative procedure among subdomains in which transmission conditions at interfaces are taken into account partly in one subdomain and partly it is adjacent. No global preconditioner is needed in the practice, but simply single-domain solvers, reducing at most the computational complexity. An optimal strategy for an automatic selection of a relaxation parameter to be used at interface subdomains is indicated. Applications are given to elliptic equations and to incompressible Stokes equations.