Minisymposium 1: Domain Decomposition Methods for Simulation-constrained Optimization

0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

By simulation we refer to numerical solution of systems governed by partial differential (or integral) equations. Tremendous strides in large-scale algorithms and hardware have provided the framework for high fidelity simulations, to the point that it is now practical to consider complex optimization problems. In such problems we wish to determine various parameters that typically consist the data of a simulation: boundary and initial conditions, material properties, distributed forces, or shape.

Cite

CITATION STYLE

APA

Akcelik, V., Biros, G., & Ghattas, O. (2007). Minisymposium 1: Domain Decomposition Methods for Simulation-constrained Optimization. Lecture Notes in Computational Science and Engineering, 55, 153. https://doi.org/10.1007/978-3-540-34469-8_13

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free