Problems of minimal aerodynamic resistance

Nesta tese estamos preocupados com o problema da resistência mínima primeiro dirigida por I. Newton em seu Principia (1687): encontrar o corpo de resistência mínima que se desloca através de um médio. As partículas do médio não interagem entre si, bem como a interação das partículas com o corpo é perfeitamente elástica. Diferentes abordagens desse modelo foram feitas por vários matemáticos nos últimos 20 anos. Aqui damos uma visão geral sobre estes resultados que representa interesse independente, uma vez que os autores diferentes usam notações diferentes. Apresentamos uma solução do problema de minimização na classe de corpos de revolução geralmente não convexos e simplesmente conexos. Acontece que nessa classe existem corpos com resistência menor do que o mínimo da resistência na classe de corpos convexos de revolução. Encontramos o infimum da resistência nesta classe e construimos uma sequência regular de corpos que aproxima este infimum. Também apresentamos um corpo de resistência nula. Até agora ninguém sabia se tais corpos existem ou não, evidentemente o nosso corpo não pertence a nenhuma classe anteriormente analisado. Este corpo é não convexo e não simplesmente conexo; a forma topológica dele é um toro, parece um UFO extraterrestre. Apresentamos aqui várias famílias de tais corpos e estudamos as suas propriedades. Também apresentamos um corpo que é natural de chamar um corpo "invisíveis em uma direção", uma vez que a trajectória de cada partícula com a certa direcção coincide com a linha recta fora do invólucro convexo do corpo. ABSTRACT: In this thesis we are concerned with the problem of minimal resistance first addressed by I. Newton in his Principia (1687): find the body of minimal resistance moving through a medium. The medium particles do not mutually interact, and the interaction of particles with the body is perfectly elastic. Different approaches to that model have been tried by several mathematicians during the last 20 years. Here we give an overview of these results that represents interest in itself since all authors use different notations. We present a solution of the minimization problem in the class of generally non convex, simply connected bodies of revolution. It happens that in this class there are bodies with smaller resistance than the minimum in the class of convex bodies of revolution. We find the infimum of the resistance in this class, and construct a sequence of bodies which approximates this infimum. Also we present a body of zero resistance. Since earlier it was unknown if such bodies exists or not, evidently our body does not belong to any class previously examined. The zero resistance body found by us is non-convex and non-simply connected; topologically it is a torus, and it looks like an extraterrestrial UFO. We present here several families of such bodies and study their properties. We also present a body which is natural to call a body "invisible in one direction", since the trajectory of each particle with the given direction, outside the convex hull of the body, coincides with a straight line.

Implicit optimality criterion for convex SIP problem with box constrained index set

We consider a convex problem of Semi-Infinite Programming (SIP) with multidimensional index set. In study of this problem we apply the approach suggested in [20] for convex SIP problems with one-dimensional index sets and based on the notions of immobile indices and their immobility orders. For the problem under consideration we formulate optimality conditions that are explicit and have the form of criterion. We compare this criterion with other known optimality conditions for SIP and show its efficiency in the convex case.

Minimal state-space realizations of 2D convolutional codes

In this thesis we consider two-dimensional (2D) convolutional codes. As happens in the one-dimensional (1D) case one of the major issues is obtaining minimal state-space realizations for these codes. It turns out that the problem of minimal realization of codes is not equivalent to the minimal realization of encoders. This is due to the fact that the same code may admit different encoders with different McMillan degrees. Here we focus on the study of minimality of the realizations of 2D convolutional codes by means of separable Roesser models. Such models can be regarded as a series connection between two 1D systems. As a first step we provide an algorithm to obtain a minimal realization of a 1D convolutional code starting from a minimal realization of an encoder of the code. Then, we restrict our study to two particular classes of 2D convolutional codes. The first class to be considered is the one of codes which admit encoders of type n 1. For these codes, minimal encoders (i.e., encoders for which a minimal realization is also minimal as a code realization) are characterized enabling the construction of minimal code realizations starting from such encoders. The second class of codes to be considered is the one constituted by what we have called composition codes. For a subclass of these codes, we propose a method to obtain minimal realizations by means of separable Roesser models.