## Finite element approximation for optimal shape design: theory and applications |

### From inside the book

Results 1-3 of 17

Page 10

... C(ft), such that IK«)llo,n + ll<n>^ll<n . For the proof of Theorems 1.7-1.9 see

Summation convention is used. 1.6. Uniform extension property Let ft G C0,1 and

u 10.

... C(ft), such that IK«)llo,n + ll<n>^ll<n . For the proof of Theorems 1.7-1.9 see

**Necas**(1967),**Necas**and Hlava- Cek (1981), Leis (1986), Nitsche (1981). 1Summation convention is used. 1.6. Uniform extension property Let ft G C0,1 and

u 10.

Page 27

... Dhatt and Touzot (1984), Elliot and Ockendon (1982), Girault and Raviart (

1986), Glowinski (1984), Glowinski, Lions and Tremoliers (1981), Hackbusch (

1985), Hlava- cek, Haslinger,

1981), ...

... Dhatt and Touzot (1984), Elliot and Ockendon (1982), Girault and Raviart (

1986), Glowinski (1984), Glowinski, Lions and Tremoliers (1981), Hackbusch (

1985), Hlava- cek, Haslinger,

**Necas**and Lovi'sek (1988),**Necas**and Hlavacek (1981), ...

Page 136

For the more detailed specification of unilateral boundary conditions in elasticity

see Hlavacek, Haslinger,

of the rigid foundation, the displacement field u corresponding to the equilibrium

...

For the more detailed specification of unilateral boundary conditions in elasticity

see Hlavacek, Haslinger,

**Necas**and Lovfsek (1988). We see that in the absenceof the rigid foundation, the displacement field u corresponding to the equilibrium

...

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### 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 conditions boundary value problem Chapter constraints contact problems convergence convex set cost functional defined denote design sensitivity analysis differentiable discrete domain elastic exist a subsequence fi(a Figure finite element fixed follows formula ft(a G K(a G R2 G U&d G V(a given gradient Green's formula Haslinger Haug Hilbert space Hlavacek initial iterations Komkov Lagrange multipliers least one solution Lemma liminf limsup linear Lipschitz Lipschitz continuous lower semicontinuous mapping material derivative method minimize Moreover Necas Neittaanmaki nodal nodes nonlinear programming nonsmooth Numerical results obtain optimal control optimal pair optimal shape design parameter Pironneau Proof prove respect results for Example satisfying sequence sequential quadratic programming shape design problems shape optimization Sokolowski solves P(a stresses subgradient sufficiently small Tc(a Theorem triangulation variational inequality vector Zolesio