Ce mémoire de thèse concerne l'interpolation sur les variétés de Grassmann et ses applications à la réduction de modèles en mécanique et plus généralement aux systèmes d'équations aux dérivées partielles d'évolution. Après une description de la méthode POD, nous introduisons les fondements théoriques en géométrie des variétés de Grassmann, qui seront utilisés dans le reste de la thèse. Ce chapitre donne à ce mémoire à la fois une rigueur mathématique au niveau des algorithmes mis au point, leur domaine de validité ainsi qu'une estimation de l'erreur en distance grassmannienne, mais également un caractère auto-contenu "self-contained" du manuscrit. Ensuite, on présente la méthode d'interpolation sur les variétés de Grassmann introduite par David Amsallem et Charbel Farhat. Cette méthode sera le point de départ des méthodes d'interpolation que nous développerons dans les chapitres suivants. La méthode de Amsallem-Farhat consiste à choisir un point d'interpolation de référence, envoyer l'ensemble des points d'interpolation sur l'espace tangent en ce point de référence via l'application logarithme géodésique, effectuer une interpolation classique sur cet espace tangent, puis revenir à la variété de Grassmann via l'application exponentielle géodésique. On met en évidence par des essais numériques l'influence du point de référence sur la qualité des résultats. Dans notre premier travail, nous présentons une version grassmannienne d'un algorithme connu dans la littérature sous le nom de Pondération par Distance Inverse (IDW). Dans cette méthode, l'interpolé en un point donné est considéré comme le barycentre des points d'interpolation où les coefficients de pondération utilisés sont inversement "proportionnels" à la distance entre le point considéré et les points d'interpolation. Dans notre méthode, notée IDW-G, la distance géodésique sur la variété de Grassmann remplace la distance euclidienne dans le cadre standard des espaces euclidiens. L'avantage de notre algorithme, dont on a montré la convergence sous certaines conditions assez générales, est qu'il ne requiert pas de point de référence contrairement à la méthode de Amsallem-Farhat. Pour remédier au caractère itératif (point fixe) de notre première méthode, nous proposons une version directe via la notion de barycentre généralisé. Notons enfin que notre algorithme IDW-G dépend nécessairement du choix des coefficients de pondération utilisés. Dans notre second travail, nous proposons une méthode qui permet un choix optimal des coefficients de pondération, tenant compte de l'auto-corrélation spatiale de l'ensemble des points d'interpolation. Ainsi, chaque coefficient de pondération dépend de tous les points d'interpolation et non pas seulement de la distance entre le point considéré et un point d'interpolation. Il s'agit d'une version grassmannienne de la méthode de Krigeage, très utilisée en géostatique. La méthode de Krigeage grassmannienne utilise également le point de référence. Dans notre dernier travail, nous proposons une version grassmannienne de l'algorithme de Neville qui permet de calculer le polynôme d'interpolation de Lagrange de manière récursive via l'interpolation linéaire entre deux points. La généralisation de cet algorithme sur une variété grassmannienne est basée sur l'extension de l'interpolation entre deux points (géodésique/droite) que l'on sait faire de manière explicite. Cet algorithme ne requiert pas le choix d'un point de référence, il est facile d'implémentation et très rapide. De plus, les résultats numériques obtenus sont remarquables et nettement meilleurs que tous les algorithmes décrits dans ce mémoire. / This dissertation deals with interpolation on Grassmann manifolds and its applications to reduced order methods in mechanics and more generally for systems of evolution partial differential systems. After a description of the POD method, we introduce the theoretical tools of grassmannian geometry which will be used in the rest of the thesis. This chapter gives this dissertation a mathematical rigor in the performed algorithms, their validity domain, the error estimate with respect to the grassmannian distance on one hand and also a self-contained character to the manuscript. The interpolation on Grassmann manifolds method introduced by David Amsallem and Charbel Farhat is afterward presented. This method is the starting point of the interpolation methods that we will develop in this thesis. The method of Amsallem-Farhat consists in chosing a reference interpolation point, mapping forward all interpolation points on the tangent space of this reference point via the geodesic logarithm, performing a classical interpolation on this tangent space and mapping backward the interpolated point to the Grassmann manifold by the geodesic exponential function. We carry out the influence of the reference point on the quality of the results through numerical simulations. In our first work, we present a grassmannian version of the well-known Inverse Distance Weighting (IDW) algorithm. In this method, the interpolation on a point can be considered as the barycenter of the interpolation points where the used weights are inversely proportional to the distance between the considered point and the given interpolation points. In our method, denoted by IDW-G, the geodesic distance on the Grassmann manifold replaces the euclidean distance in the standard framework of euclidean spaces. The advantage of our algorithm that we show the convergence undersome general assumptions, does not require a reference point unlike the method of Amsallem-Farhat. Moreover, to carry out this, we finally proposed a direct method, thanks to the notion of generalized barycenter instead of an earlier iterative method. However, our IDW-G algorithm depends on the choice of the used weighting coefficients. The second work deals with an optimal choice of the weighting coefficients, which take into account of the spatial autocorrelation of all interpolation points. Thus, each weighting coefficient depends of all interpolation points an not only on the distance between the considered point and the interpolation point. It is a grassmannian version of the Kriging method, widely used in Geographic Information System (GIS). Our grassmannian Kriging method require also the choice of a reference point. In our last work, we develop a grassmannian version of Neville's method which allow the computation of the Lagrange interpolation polynomial in a recursive way via the linear interpolation of two points. The generalization of this algorithm to grassmannian manifolds is based on the extension of interpolation of two points (geodesic/straightline) that we can do explicitly. This algorithm does not require the choice of a reference point, it is easy to implement and very quick. Furthermore, the obtained numerical results are notable and better than all the algorithms described in this dissertation.

Centro Latino-Americano de Física / Os processos estocásticos com ruído branco multiplicativo são objeto de atenção constante em uma grande área da pesquisa científica. A variedade de prescrições possíveis para definir matematicamente estes processos oferece um obstáculo ao desenvolvimento de ferramentas gerais para seu tratamento. Na presente tese, estudamos propriedades de equilíbrio de processos markovianos com ruído branco multiplicativo. Para conseguirmos isto, definimos uma transformação de reversão temporal de tais processos levando em conta que a distribuição estacionária de probabilidade depende da prescrição. Deduzimos um formalismo funcional visando obter o funcional gerador das funções de correlação e resposta de um processo estocástico multiplicativo representado por uma equação de Langevin. Ao representar o processo estocástico neste formalismo (de Grassmann) funcional eludimos a necessidade de fixar uma prescrição particular. Neste contexto, analisamos as propriedades de equilíbrio e estudamos as simetrias ocultas do processo. Mostramos que, usando uma definição apropriada da distribuição de equilíbrio e considerando a transformação de reversão temporal adequada, as propriedades usuais de equilíbrio são satisfeitas para qualquer prescrição. Finalmente, apresentamos uma dedução detalhada da formulação supersimétrica covariante de um processo markoviano com ruído branco multiplicativo e estudamos algumas das relações impostas pelas funções de correlação através das identidades de Ward-Takahashi. / Multiplicativewhite-noise stochastic processes continuously attract the attention of a wide area of scientific research. The variety of prescriptions available to define it difficults the development of general tools for its characterization. In this thesis, we study equilibrium properties of Markovian multiplicative white-noise processes. For this, we define the time reversal transformation for this kind of processes, taking into account that the asymptotic stationary probability distribution depends on the prescription. We deduce a functional formalism to derive a generating functional for correlation and response functions of a multiplicative stochastic process represented by a Langevin equation. Representing the stochastic process in this functional (Grassmann) formalism, we avoid the necessity of fixing a particular prescription. In this framework, we analyze equilibrium properties and study hidden symmetries of the process. We show that, using a careful definition of equilibrium distribution and taking into account the appropriate time reversal transformation, usual equilibrium properties are satisfied for any prescription. Finally, we present a detailed deduction of a covariant supersymmetric formulation of a multiplicativeMarkovian white-noise process and study some of the constraints it imposes on correlation functions using Ward-Takahashi identities.

Centro Latino-Americano de Física / Os processos estocásticos com ruído branco multiplicativo são objeto de atenção constante em uma grande área da pesquisa científica. A variedade de prescrições possíveis para definir matematicamente estes processos oferece um obstáculo ao desenvolvimento de ferramentas gerais para seu tratamento. Na presente tese, estudamos propriedades de equilíbrio de processos markovianos com ruído branco multiplicativo. Para conseguirmos isto, definimos uma transformação de reversão temporal de tais processos levando em conta que a distribuição estacionária de probabilidade depende da prescrição. Deduzimos um formalismo funcional visando obter o funcional gerador das funções de correlação e resposta de um processo estocástico multiplicativo representado por uma equação de Langevin. Ao representar o processo estocástico neste formalismo (de Grassmann) funcional eludimos a necessidade de fixar uma prescrição particular. Neste contexto, analisamos as propriedades de equilíbrio e estudamos as simetrias ocultas do processo. Mostramos que, usando uma definição apropriada da distribuição de equilíbrio e considerando a transformação de reversão temporal adequada, as propriedades usuais de equilíbrio são satisfeitas para qualquer prescrição. Finalmente, apresentamos uma dedução detalhada da formulação supersimétrica covariante de um processo markoviano com ruído branco multiplicativo e estudamos algumas das relações impostas pelas funções de correlação através das identidades de Ward-Takahashi. / Multiplicativewhite-noise stochastic processes continuously attract the attention of a wide area of scientific research. The variety of prescriptions available to define it difficults the development of general tools for its characterization. In this thesis, we study equilibrium properties of Markovian multiplicative white-noise processes. For this, we define the time reversal transformation for this kind of processes, taking into account that the asymptotic stationary probability distribution depends on the prescription. We deduce a functional formalism to derive a generating functional for correlation and response functions of a multiplicative stochastic process represented by a Langevin equation. Representing the stochastic process in this functional (Grassmann) formalism, we avoid the necessity of fixing a particular prescription. In this framework, we analyze equilibrium properties and study hidden symmetries of the process. We show that, using a careful definition of equilibrium distribution and taking into account the appropriate time reversal transformation, usual equilibrium properties are satisfied for any prescription. Finally, we present a detailed deduction of a covariant supersymmetric formulation of a multiplicativeMarkovian white-noise process and study some of the constraints it imposes on correlation functions using Ward-Takahashi identities.

L’étude réalisée dans cette thèse porte sur les phénomènes critiques classiques et quantiques. En effet, les phénomènes critiques et les transitions de phases sont devenus des sujets fondamentaux en physique statistique moderne et en théorie des champs et nous proposons dans cette thèse d’étudier certains modèles qui présentent un comportement critique, à la fois à l’équilibre et hors de l’équilibre. Dans la première partie de la thèse, certaines propriétés du modèle de dimères à deux dimensions sont étudiées. Ce modèle a été largement étudié dans les communautés de physique statistique et de mathématiques et un grand nombre d’applications en physique de la matière condensée existent. Ici, nous proposons de mettre l’accent sur des solutions exactes du modèle et d’utiliser l’invariance conforme afin d’avoir une compréhension profonde de ce modèle en présence de monomères et/ou en présence de bords. Les mêmes types d’outils sont ensuite utilisés pour explorer un autre phénomène important apparaissant dans les modèles de dimères et de chaînes de spin : le cercle arctique. Le but étant de trouver une description adéquate en termes de théorie des champs de ce phénomène, en utilisant des calculs exacts ainsi que de l’analyse asymptotique. La deuxième partie de la thèse concerne les phénomènes critiques hors de l’équilibre dans le contexte des modèles de croissance d’interfaces. Ce domaine de recherche est très important de nos jours, principalement en raison de la découverte de l’équation Kardar-Parisi-Zhang et de ses relations avec les ensembles de matrices aléatoires. La phénoménologie de ces modèles en présence des bords est analysée via des solutions exactes et des simulations numériques, on montre alors que des comportements surprenants apparaissent proches des bords / The study carried in this thesis concerns classical and quantum critical phenomena. Indeed, critical behaviors and phase transitions are fundamental topics in modern statistical physics and field theory and we propose in this thesis to study some models which exhibit such behaviors both at equilibrium and out of equilibrium. In the first part of the thesis, some properties of the two-dimensional dimer model are studied. This model has been studied extensively in the statistical physics and mathematical communities and a lot of applications in condensed matter physics exist. Here we propose to focus on exact solutions of the model and conformal invariance in order to have a deep understanding of this model in presence of monomers, and/or boundaries. The same kind of tools are then used to explore another important phenomenon appearing in dimer models and spin chains: the arctic circle. The goal was to find a proper field theoretical description of this phenomenon using exact solutions and asymptotic analysis. The second part of the thesis concerns out of equilibrium critical phenomena in the context of interface growth models. This field of research is very important nowadays, mainly because of the Kardar-Parisi-Zhang equation and its relations with random matrix ensembles. The phenomenology of these models in presence of boundaries is studied via exact solutions and numerical simulations, we show that surprising behaviors appear close to the boundaries

The concept of a propagator is useful and is a well-known object in diffusion NMR experiments. Here, we investigate the related concept; the propagator for the magnetization or the Green’s function of the Torrey-Bloch equations. The magnetization propagator is constructed by defining functions such as the Hamiltonian and Lagrangian and using these to define a path integral. It is shown that the equations of motion derived from the Lagrangian produce complex-valued trajectories (classical paths) and it is conjectured that the end-points of these trajectories are real-valued. The complex nature of the trajectories also suggests that the spin degrees of freedom are also encoded into the trajectories and this idea is explored by explicitly modeling the spin or precessing magnetization by anticommuting Grassmann variables. A pseudoclassical Lagrangian is constructed by combining the diffusive (bosonic) Lagrangian with the Grassmann (fermionic) Lagrangian, and performing the path integral over the Grassmann variables recovers the original Lagrangian that was used in the construction of the propagator for the magnetization. The trajectories of the pseudoclassical model also provide some insight into the nature of the end-points.

Submitted by Johnny Rodrigues (johnnyrodrigues@ufcg.edu.br) on 2018-08-05T13:56:35Z No. of bitstreams: 1 NANCY LIMA COSTA - DISSERTAÇÃO PPGMAT 2012..pdf: 696380 bytes, checksum: b115561e2d297770211db99b1ed44747 (MD5) / Made available in DSpace on 2018-08-05T13:56:35Z (GMT). No. of bitstreams: 1 NANCY LIMA COSTA - DISSERTAÇÃO PPGMAT 2012..pdf: 696380 bytes, checksum: b115561e2d297770211db99b1ed44747 (MD5) Previous issue date: 2012-08 / Capes / Neste trabalho de dissertação estudamos as identidades polinomiais ordinárias para a Álgebra de Grassmann com unidade, denotada por E, e sem unidade, denotada por E 0, para corpos de característica diferente de 2. Além disso, também estudamos as identidades Z2-graduadas da álgebra E no caso em que o corpo tem característica positiva. Por fim, descrevemos o T-espaço dos polinômios centrais de E tanto para corpos de característica zero, quanto para corpos de característica positiva e descrevemos também os polinômios centrais de E 0 para corpos de característica positiva. / In this dissertation we study the ordinary polynomial identities for the Grassmann Algebra with unity, denoted by E, and without unity, denoted by E 0, for fields of characteristic di erent from 2. We also study the Z2-graded identities of the algebra E over elds of positive characteristic. Finaly, we describe the T-space of the central polynomials of E for fields of characteristic zero and also for fields of positive characteristic, moreover we describe the T-space of the central polynomials of E 0 for fields of positive characteristic.

Submitted by Johnny Rodrigues (johnnyrodrigues@ufcg.edu.br) on 2018-07-27T15:29:31Z No. of bitstreams: 1 ANTONIO IGOR SILVA DE OLIVEIRA - DISSERTAÇÃO PPGMAT 2011..pdf: 599013 bytes, checksum: 2ae31549fdd89221db237ef278b5a688 (MD5) / Made available in DSpace on 2018-07-27T15:29:31Z (GMT). No. of bitstreams: 1 ANTONIO IGOR SILVA DE OLIVEIRA - DISSERTAÇÃO PPGMAT 2011..pdf: 599013 bytes, checksum: 2ae31549fdd89221db237ef278b5a688 (MD5) Previous issue date: 2011-09 / Capes / As ideias de codimensões e cocaracteres de uma PI-álgebra são de grande importância e são centrais nas aplicações das representações dos grupos simétricos à PIteoria (teoria das identidades polinomiais). Os conceitos de codimensão e cocaracter começaram a ser estudados em 1972 por Amitai Regev em seu importante trabalho sobre identidades polinomiais do produto tensorial de PI-álgebras. Ao longo das últimas décadas muitos resultados importantes surgiram com o uso das representações e dos métodos assintóticos na PI-teoria. Neste trabalho apresentaremos inicialmente ideias e resultados básicos da Teoria de Young sobre as representações dos grupos simétricos. De posse desses resultados, estudaremos as sequências limitadas de codimensões e as sequências de cocaracteres de álgebras que satisfazem alguma identidade de Capelli. Apresentaremos também os cálculos das codimensões e dos cocaracteres da álgebra de Grassmann. / The ideas of codimensions and cocharacters of a PI-algebra are of great and central importance in the applications of representations of symmetric groups to PI-theory (theory of the polynomial identities). The study of the concepts of codimensions and cocharacters started in 1972 by Amitai Regev in his important work about polynomial identities of the tensor product of PI-algebras. During the last decades many important results arose with the use of representations and asymptotic methods in PI-theory. In this work we will present firstly ideas and basic results in the Young’s theory about the representations of symmetric groups. With these results we shall study the limited sequences of codimensions and the cocharacter sequences of algebras that satisfy some of the Capelli identity. It will also be presented the calculation of the codimensions and cocharacters of the Grassmann Algebra.

Les travaux regroupés dans cette th`ese traitent de différents aspects de la physique statistique dessystèmes corrélés. Dans la première partie de cette thèse on s'intéresse aux fluctuations de grandeurs globalesdans les systèmes corrélés, dont de nombreux travaux sur des systèmes variés proposent qu'elles soientbien d´ecrites par la distribution BHP issue du modèle XY 2d. Le modèle d'Ising 2d est utilisé pour tester cette proposition et laquantifier. En utilisant des observations issues de simulations Monte Carlo, une étude analytique montre quel'apparente universalité de BHP est reliée au modèle gaussien obtenu par perturbation. et que des écarts àBHP d'importance variable existe, provenant de la contribution d'un terme non-gaussien. Dans la secondepartie, on s'intéresse à l'étude de la décohérence d'un système quantique à deux niveaux, induite par unbruit intermittent présentant un spectre en 1/f et du vieillissement. Un tel bruit peut schématiser l'effet d'unenvironnement corrélé sur un Qbit. En utilisant des résultats de probabilité, on peut calculer le facteur dedécohérence dans de nombreux régimes. On obtient alors des scénarios de décohérence anormaux, présentantune décroissance en loi de puissance aux temps longs, ainsi que de la non-stationnarité. Enfin la dernièrepartie est dédiée `a l'étude des solutions exactes du modèle d'Ising 2d classique, avec un champ magnétiquesur un bord. En généralisant une méthode due à Plechko, on obtient la fonction de partition de ce systèmeau moyen d'une action gaussienne fermionique unidimensionnelle. Dans le cas d'un champ homogène, onretrouve les résultats précédents de McCoy et Wu. On peut aller au-delà en considérant le cas où le champmagnétique change de direction une fois au bord. Cette méthode permet alors de décrire une transition detype mouillage, induite par ce défaut d'orientation. Il est en particulier possible d'obtenir analytiquement lediagramme de phase de ce système.

Les motivations initiales de ce travail proviennent de l'étalonnage de caméras en vision artificielle. Nous nous sommes surtout intéressés aux manières d'exploiter des mesures dans les images (détection d'objets) et des considérations géométriques formelles. Nous avons élargi nos recherches à la problématique suivante :"l'interaction entre symbolique et numérique ". Ce travail se divise en trois parties. La première partie traite de la résolution d'équations polynomiales avec des coefficients approchés. Nous étudions des méthodes matricielles qui transforment la résolution en la recherche des valeurs et des vecteurs propres d'une matrice. Ces transformations et et les calculs de valeurs et vecteurs propres sont continues par rapport aux coefficients et permettent donc de résoudre des équations à coefficients approchés. La deuxième partie présente un cadre algébrique permettant d'exprimer simplement des contraintes géométriques. Ce formalisme nous a permis de modéliser de manière fine l'étalonnage d'une ou plusieurs caméras avec l'aide d'un plan. L'étalonnage ne peut être effectué pratiquement qu'avec des résolutions numériques de systèmes linéaires. La troisième partie est consacrée à l'étude et surtout à l'utilisation des outils de démonstration automatique en géométrie pour la construction de modèles 3D articulés. Par des optimisations numériques, nous déterminons les paramètres des modèles articulés qui permettent aux images de ces modèles de coïncider avec les données extraites des photographies

Wireless networks are increasingly interference-limited, which motivates the development of sophisticated interference management techniques. One recently discovered approach is interference alignment, which attains the maximum sum rate scaling (with signal-to-noise ratio) in many network configurations. Interference alignment is not yet well understood from an engineering perspective. Such design considerations include (i) partial rather than complete knowledge of channel state information, (ii) correlated channels, (iii) bursty packet-based network traffic that requires the frequent setup and tear down of sessions, and (iv) the spatial distribution and interaction of transmit/receive pairs. This dissertation aims to establish the benefits and limitations of interference alignment under these four considerations. The first contribution of this dissertation considers an isolated group of transmit/receiver pairs (a cluster) cooperating through interference alignment and derives the signal-to-interference-plus-noise ratio distribution at each receiver for each stream. This distribution is used to compare interference alignment to beamforming and spatial multiplexing (as examples of common transmission techniques) in terms of sum rate to identify potential switching points between them. This dissertation identifies such switching points and provides design recommendations based on severity of the correlation or the channel state information uncertainty. The second contribution considers transmitters that are not associated with any interference alignment cooperating group but want to use the channel. The goal is to retain the benefits of interference alignment amid interference from the out-of-cluster transmitters. This dissertation shows that when the out-of-cluster transmitters have enough antennas, they can access the channel without changing the performance of the interference alignment receivers. Furthermore, optimum transmit filters maximizing the sum rate of the out-of-cluster transmit/receive pairs are derived. When insufficient antennas exist at the out-of-cluster transmitters, several transmit filters that trade off complexity and sum rate performance are presented. The last contribution, in contrast to the first two, takes into account the impact of large scale fading and the spatial distribution of the transmit/receive pairs on interference alignment by deriving the transmission capacity in a decentralized clustered interference alignment network. Channel state information uncertainty and feedback overhead are considered and the optimum training period is derived. Transmission capacity of interference alignment is compared to spatial multiplexing to highlight the tradeoff between channel estimation accuracy and the inter-cluster interference; the closer the nodes to each other, the higher the channel estimation accuracy and the inter-cluster interference. / text