2 resultados para Optimal Design

em Nottingham eTheses


Relevância:

30.00% 30.00%

Publicador:

Resumo:

The stirring of a body of viscous fluid using multiple stirring rods is known to be particularly effective when the rods trace out a path corresponding to a nontrivial mathematical braid. The optimal braid is the so-called "pigtail braid", in which three stirring rods execute the usual "over-under" motion associated with braiding plaiting) hair. We show how to achieve this optimal braiding motion straightforwardly: one stirring rod is driven in a figure-of-eight motion, while the other two rods are baffles, which rotate episodically about their common centre. We also explore the extent to which the physical baffles may be replaced by flow structures (such as periodic islands).

Relevância:

30.00% 30.00%

Publicador:

Resumo:

In this article we propose a new symmetric version of the interior penalty discontinuous Galerkin finite element method for the numerical approximation of the compressible Navier-Stokes equations. Here, particular emphasis is devoted to the construction of an optimal numerical method for the evaluation of certain target functionals of practical interest, such as the lift and drag coefficients of a body immersed in a viscous fluid. With this in mind, the key ingredients in the construction of the method include: (i) An adjoint consistent imposition of the boundary conditions; (ii) An adjoint consistent reformulation of the underlying target functional of practical interest; (iii) Design of appropriate interior-penalty stabilization terms. Numerical experiments presented within this article clearly indicate the optimality of the proposed method when the error is measured in terms of both the L_2-norm, as well as for certain target functionals. Computational comparisons with other discontinuous Galerkin schemes proposed in the literature, including the second scheme of Bassi & Rebay, cf. [11], the standard SIPG method outlined in [25], and an NIPG variant of the new scheme will be undertaken.