A gradient method approach to optimization-based multidisciplinary simulations and nonoverlapping domain decomposition algorithms

It has been shown recently that optimization-based nonoverlapping domain de composition algorithms are connected to many well-known algorithms. Using a gradient-type iterative strategy for the optimization problem, we present further discussion on how to develop various algorithms that can integrate subdomain solvers into a solver for the problem in the whole domain. In par ticular, the algorithms we discuss can be used to develop efficient solvers of multidisciplinary problems which are constructed using existing subdoma in solvers without the need for making changes in the latter.