Please use this identifier to cite or link to this item: http://hdl.handle.net/1783.1/1776

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

Authors Du, Q
Gunzburger, MD
Issue Date 2000
Source SIAM journal on numerical analysis, v. 37, (5), 2000, MAY 26, p. 1513-1541
Summary It has been shown recently that optimization-based nonoverlapping domain decomposition 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 particular, the algorithms we discuss can be used to develop efficient solvers of multidisciplinary problems which are constructed using existing subdomain solvers without the need for making changes in the latter.
Subjects
ISSN 0036-1429
Rights Copyright © SIAM. This paper is made available with permission of the Society for Industrial and Applied Mathematics for limited noncommerical distribution only.
Language English
Format Article
Access View full-text via Web of Science
View full-text via Scopus
Find@HKUST
Files in this item:
File Description Size Format
34308.pdf 267.84 kB Adobe PDF