Premium
Best domain for an elliptic problem in cartesian coordinates by means of shape‐measure
Author(s) -
Fakharzadeh Jahromi Alireza,
Rubio Julior E.
Publication year - 2009
Publication title -
asian journal of control
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.769
H-Index - 53
eISSN - 1934-6093
pISSN - 1561-8625
DOI - 10.1002/asjc.134
Subject(s) - cartesian coordinate system , domain (mathematical analysis) , measure (data warehouse) , optimal control , mathematics , polar coordinate system , function (biology) , mathematical optimization , bellman equation , control variable , computer science , mathematical analysis , geometry , database , evolutionary biology , biology , statistics
In ( ZAA J. Anal. Appl. , Vol. 16, No. 1, pp. 143–155) we introduced a method to determine the optimal domains for elliptic optimal‐shape design problems in polar coordinates. However, the same problem in cartesian coordinates, which are more applicable, is found to be much harder, therefore we had to develop a new approach for these designs. Herein, the unknown domain is divided into a fixed and a variable part and the optimal pair of the domain and its optimal control, is characterized in two stages. Firstly, the optimal control for the each given domain is determined by changing the problem into a measure‐theoretical one, replacing this with an infinite dimensional linear programming problem and approximating schemes; then the nearly optimal control function is characterized. Therefore a function that offers the optimal value of the objective function for a given domain, is defined. In the second stage, by applying a standard optimization method, the global minimizer pair will be obtained. Some numerical examples are also given. Copyright © 2009 John Wiley and Sons Asia Pte Ltd and Chinese Automatic Control Society