One-Shot Domain Decomposition Methods for Shape Optimization Problems
Shape optimization aims to optimize an objective function by changing the shape of the computational domain. In recent years, shape optimization has received considerable attentions. On the theoretical side there are several publications dealing with the existence of solution and the sensitivity analysis of the problem; see e.g.,  and references therein.
Unable to display preview. Download preview PDF.
- .S. Balay, K. Buschelman, V. Eijkhout, W. D. Gropp, D. Kaushik, M. G. Knepley, L. C. McInnes, B. F. Smith, and H. Zhang. PETSc Users Manual. Technical report, Argonne National Laboratory, 2010.Google Scholar
- .G. Biros and O. Ghattas. Parallel Lagrange-Newton-Krylov-Schur methods for PDE-constrained optimization. Part I: The Krylov-Schur solver. SIAM J. Sci. Comput., 27:687–713, 2005.Google Scholar
- .O. Ghattas and C. Orozco. A parallel reduced Hessian SQP method for shape optimization. In N. M. Alexandrov and M.Y. Hussaini, editors, Multidisciplinary Design Optimization: State of the Art, pages 133–152. SIAM, Philadelphia, 1997.Google Scholar
- .A. Toselli and O. Widlund. Domain Decomposition Methods: Algorithms and Theory. Springer-Verlag, Berlin, 2005.Google Scholar