Finite Element Approximation for Optimal Shape Design: Theory and ApplicationsExplains how to speed the optimal shape design process using a computer. Outlines the problems inherent in optimal shape design and discusses methods of their solution. Concentrates on finite element approximation and describes numerical realization of optimization techniques. Treats optimal design problems via the optimal control theory when the state systems are governed by variational inequalities. Provides useful background information, followed by numerous approaches to optimal shape design, all supported by illustrative examples. Appendices provide algorithms and numerous examples and their calculations are included. |
From inside the book
Results 1-3 of 36
Page 79
... programming problems with box constraints , linear inequality constraints and with one equality constraint . When choosing a nonlinear programming algorithm the following features of Problem ( P ; ) have to be taken into account . ( i ) ...
... programming problems with box constraints , linear inequality constraints and with one equality constraint . When choosing a nonlinear programming algorithm the following features of Problem ( P ; ) have to be taken into account . ( i ) ...
Page 91
... programming software Most of the general purpose codes for the numerical solution of nonlinear mathematical programming problems follow a similiar structure . The user must write a main program that calls for the optimization module ...
... programming software Most of the general purpose codes for the numerical solution of nonlinear mathematical programming problems follow a similiar structure . The user must write a main program that calls for the optimization module ...
Page 300
... programming ( SQP ) algorithm The NAG - routine E04VCF ( Numerical Algorithm Group Ltd ) is essentially the NPSOL - routine due to Gill , Murray , Saunders and Wright ( 1984 ) . We shall briefly mention the basic ideas in solving the ...
... programming ( SQP ) algorithm The NAG - routine E04VCF ( Numerical Algorithm Group Ltd ) is essentially the NPSOL - routine due to Gill , Murray , Saunders and Wright ( 1984 ) . We shall briefly mention the basic ideas in solving the ...
Contents
Preliminaries | 1 |
Abstract setting of optimal shape design problem and | 28 |
Optimal shape design of systems governed by a unilateral | 53 |
Copyright | |
10 other sections not shown
Other editions - View all
Common terms and phrases
adjoint algorithm Appendix applied approximation boundary value problem C₁ Céa compute constraints contact problems convex convex set cost functional defined denote design sensitivity analysis differentiable discrete domain elastic exist a subsequence Figure Find finite element follows formula given Gm(a H¹(Î Haslinger Haug Hlaváček I₁ Ir(an ITERATION jEJk Komkov Lagrange multipliers least one solution Lemma lim inf lim sup linear Lipschitz Lipschitz continuous lower semicontinuous mapping material derivative matrix method minimization Nečas Neittaanmäki nodes nonlinear nonlinear programming nonsmooth Numerical results obtain optimal control optimal design optimal pair optimal shape design parameter Pironneau Proof results for Example Section sensitivity analysis sequence shape design problems Shape optimization Sokolowski solves P(a subgradient subset T₁ Theorem triangulation un(an unilateral boundary value variational inequality vector w₁ Zolesio г₁