La maintenance prédictive joue un rôle important dans le maintien des systèmes de production continue car elle peut aider à réduire les interventions inutiles ainsi qu'à éviter des pannes imprévues. En effet, par rapport à la maintenance conditionnelle, la maintenance prédictive met en œuvre une étape supplémentaire, appelée le pronostic. Les opérations de maintenance sont planifiées sur la base de la prédiction des états de détérioration futurs et sur l'estimation de la vie résiduelle du système. Dans le cadre du projet européen FP7 SUPREME (Sustainable PREdictive Maintenance for manufacturing Equipment en Anglais), cette thèse se concentre sur le développement des modèles de détérioration stochastiques et sur des méthodes d'estimation de la vie résiduelle (Remaining Useful Life – RUL en anglais) associées pour les adapter aux cas d'application du projet. Plus précisément, les travaux présentés dans ce manuscrit sont divisés en deux parties principales. La première donne une étude détaillée des modèles de détérioration et des méthodes d'estimation de la RUL existant dans la littérature. En analysant leurs avantages et leurs inconvénients, une adaptation d’une approche de l'état de l'art est mise en œuvre sur des cas d'études issus du projet SUPREME et avec les données acquises à partir d’un banc d'essai développé pour le projet. Certains aspects pratiques de l’implémentation, à savoir la question de l'échange d'informations entre les partenaires du projet, sont également détaillées dans cette première partie. La deuxième partie est consacrée au développement de nouveaux modèles de détérioration et les méthodes d'estimation de la RUL qui permettent d'apporter des éléments de solutions aux problèmes de modélisation de détérioration et de prédiction de RUL soulevés dans le projet SUPREME. Plus précisément, pour surmonter le problème de la coexistence de plusieurs modes de détérioration, le concept des modèles « multi-branche » est proposé. Dans le cadre de cette thèse, deux catégories des modèles de type multi-branche sont présentées correspondant aux deux grands types de modélisation de l'état de santé des système, discret ou continu. Dans le cas discret, en se basant sur des modèles markoviens, deux modèles nommés Mb-HMM and Mb-HsMM (Multi-branch Hidden (semi-)Markov Model en anglais) sont présentés. Alors que dans le cas des états continus, les systèmes linéaires à sauts markoviens (JMLS) sont mis en œuvre. Pour chaque modèle, un cadre à deux phases est implémenté pour accomplir à la fois les tâches de diagnostic et de pronostic. A travers des simulations numériques, nous montrons que les modèles de type multi-branche peuvent donner des meilleures performances pour l'estimation de la RUL par rapport à celles obtenues par des modèles standards mais « mono-branche ». / Predictive maintenance plays a crucial role in maintaining continuous production systems since it can help to reduce unnecessary intervention actions and avoid unplanned breakdowns. Indeed, compared to the widely used condition-based maintenance (CBM), the predictive maintenance implements an additional prognostics stage. The maintenance actions are then planned based on the prediction of future deterioration states and residual life of the system. In the framework of the European FP7 project SUPREME (Sustainable PREdictive Maintenance for manufacturing Equipment), this thesis concentrates on the development of stochastic deterioration models and the associated remaining useful life (RUL) estimation methods in order to be adapted in the project application cases. Specifically, the thesis research work is divided in two main parts. The first one gives a comprehensive review of the deterioration models and RUL estimation methods existing in the literature. By analyzing their advantages and disadvantages, an adaption of the state of the art approaches is then implemented for the problem considered in the SUPREME project and for the data acquired from a project's test bench. Some practical implementation aspects, such as the issue of delivering the proper RUL information to the maintenance decision module are also detailed in this part. The second part is dedicated to the development of innovative contributions beyond the state-of-the-are in order to develop enhanced deterioration models and RUL estimation methods to solve original prognostics issues raised in the SUPREME project. Specifically, to overcome the co-existence problem of several deterioration modes, the concept of the "multi-branch" models is introduced. It refers to the deterioration models consisting of different branches in which each one represent a deterioration mode. In the framework of this thesis, two multi-branch model types are presented corresponding to the discrete and continuous cases of the systems' health state. In the discrete case, the so-called Multi-branch Hidden Markov Model (Mb-HMM) and the Multi-branch Hidden semi-Markov model (Mb-HsMM) are constructed based on the Markov and semi-Markov models. Concerning the continuous health state case, the Jump Markov Linear System (JMLS) is implemented. For each model, a two-phase framework is carried out for both the diagnostics and prognostics purposes. Through numerical simulations and a case study, we show that the multi-branch models can help to take into account the co-existence problem of multiple deterioration modes, and hence give better performances in RUL estimation compared to the ones obtained by standard "single branch" models.

Submitted by Luiz Cesar Maranho (lc-maranho@bol.com.br) on 2018-10-11T20:16:50Z No. of bitstreams: 1 Dissertação Final.pdf: 1883342 bytes, checksum: 85a25606a3113b39d6d4354dcaa161d8 (MD5) / Approved for entry into archive by Elza Mitiko Sato null (elzasato@ibilce.unesp.br) on 2018-10-15T12:39:20Z (GMT) No. of bitstreams: 1 maranho_lc_me_sjrp.pdf: 5069791 bytes, checksum: 2501e6acc67bdd7103eb807f326a4c0b (MD5) / Made available in DSpace on 2018-10-15T12:39:20Z (GMT). No. of bitstreams: 1 maranho_lc_me_sjrp.pdf: 5069791 bytes, checksum: 2501e6acc67bdd7103eb807f326a4c0b (MD5) Previous issue date: 2018-08-20 / O mosquito Aedes aegypti é o principal vetor responsável por diversas arboviroses como a dengue, a febre amarela, o vírus zika e a febre chikungunya. Devido a sua resistência, adaptabilidade e proximidade ao homem, o Aedes aegypti é atualmente um dos maiores problemas de saúde pública no Brasil e nas Américas. Mesmo com os avanços e investimentos em pesquisas com vacinas, monitoramento, campanhas educativas e diversos tipos de controle deste vetor, ainda não existe um método eficaz para controlar e erradicar o mosquito. Portanto, esse trabalho destina-se ao auxílio na criação de estratégias para controlar esse agente transmissor, mediante a análise do espaço de estados e a estabilidade assintótica de uma dinâmica não linear para controle populacional do Aedes aegypti via a técnica de linearização de Lyapunov, além de apresentação de formas de prevenção e combate aos criadouros do mosquito. A dinâmica não linear proposta é uma dinâmica simplificada obtida de um modelo não linear existente na literatura, proposto por Esteva e Yang em 2005 e se baseia no ciclo de vida do mosquito, que é dividido em duas fases: fase imatura ou aquática (ovos, larvas e pupas) e fase alada (mosquitos adultos). Na fase adulta, os mosquitos são divididos em machos, fêmeas imaturas e fêmeas fertilizadas, sendo que a dinâmica proposta nesta dissertação de mestrado é baseada nos estudos efetuados por Reis desde 2016, obtendo um modelo simplificado no qual a soma das densidades das populações de fêmeas imaturas e fêmeas fertilizadas serão consideradas como fêmeas adultas. / The mosquito Aedes aegypti is the main vector responsible for several arboviruses such as dengue fever, yellow fever, zika virus and chikungunya fever. Due to its resistance, adaptability and proximity to humans, Aedes aegypti is currently one of the major public health problems in Brazil and the Americas. Even with the advances and investments in research with vaccines, monitoring, educational campaigns and various types of control of this vector, there is still no effective method to control and eradicate the mosquito. Therefore, this work is intended to aid in the creation of strategies to control this transmitting agent by analyzing the state space and the asymptotic stability of a nonlinear dynamics for population control of Aedes aegypti via the Lyapunov linearization technique to present ways of preventing and combating mosquito breeding sites. The proposed nonlinear dynamics is a simplified dynamics obtained from a nonlinear model existing in the literature, proposed by Esteva and Yang in 2005 and based on the life cycle of the mosquito, which is divided into two phases: immature or aquatic phase (eggs, larvae and pupae) and winged phase (adult mosquitoes). In the adult phase, mosquitoes are divided into males, immature females and fertilized females, and the dynamics proposed in this dissertation is based on studies carried out by Reis since 2016, obtaining a simplified model in which the sum of the densities of the populations of females immature and fertilized females will be considered as adult females.

Este trabalho trata do desenvolvimento de um material didático, sob a forma de cadernos (presentemente, em forma de capítulos), acompanhado de protótipo de circuito simples para testes experimentais, a ser utilizado no ensino de nível médio. O conteúdo reunido nos cadernos abrange o desenvolvimento analítico de tópicos pertinentes à física-matemática, esquema para a construção do protótipo e exemplos utilizando recursos computacionais. Mais especificamente, buscou-se enfatizar o ensino dos tópicos de equações e sistemas lineares, motivados por fenômenos físicos. Pretendeu-se explorar o aspecto experimental (com a construção e o uso de protótipo de circuitos simples), o analítico (com a resolução de equações e sistemas lineares, e com uma introdução à programação linear) e o computacional (com uso da planilha eletrônica). Em todos os conteúdos desenvolvidos, é dada especial ênfase à interpretação, à análise e à validação dos resultados. Com este material, procura-se oferecer ao professor um conjunto de atividades didático-pedagógicas, que possam estimular a sua atuação crítica e criativa. E que, também, propiciem a reflexão e a análise na identificação e resolução de problemas, a fim de desencadear processos cognitivos que levem o aluno a compreender as interrelações entre a física e a matemática. / This paper is about the development of a didatic material, under the way of notebooks (here, in chapters), accompained by the prototype of simple circuit for experimental tests, to be used in high school teaching. The issue brought in the notebooks comprehends the analytic development of the topics that belong to the physics- mathematics, scheme for the building of the prototype and examples with the use of computer resources. More specifically, applied to the teaching of the topics of equations and linear systems, motivated by physics phenomena. It was intended to explore the experimental aspect (with the building of simple circuit prototype), the analytic (with the resolution of equations and linear systems, with an introduction to the linear programming) and the computer (with the use of electronic chart). In all the topics developed, a special emphasis is given to the interpretation, analysis and validating of the results. With this material, it was intended to offer the teacher a set of didatic- pedagogical activities that can stimulate the critical and creative acting. And that can also provide the thinking and analysis in the identification and resolution of problems, with the aim of triggering cognitive processes that lead the student to understand the inter-relations between physics and mathematics.

Nous considérons la résolution de très grands systèmes linéaires creux à l'aide d'une méthode de factorisation directe appelée méthode multifrontale. Bien que numériquement robustes et faciles à utiliser (elles ne nécessitent que des informations algébriques : la matrice d'entrée A et le second membre b, même si elles peuvent exploiter des stratégies de prétraitement basées sur des informations géométriques), les méthodes directes sont très coûteuses en termes de mémoire et d'opérations, ce qui limite leur applicabilité à des problèmes de taille raisonnable (quelques millions d'équations). Cette étude se concentre sur l'exploitation des approximations de rang-faible dans la méthode multifrontale, pour réduire sa consommation mémoire et son volume d'opérations, dans des environnements séquentiel et à mémoire distribuée, sur une large classe de problèmes. D'abord, nous examinons les formats rang-faible qui ont déjà été développé pour représenter efficacement les matrices denses et qui ont été utilisées pour concevoir des solveurs rapides pour les équations aux dérivées partielles, les équations intégrales et les problèmes aux valeurs propres. Ces formats sont hiérarchiques (les formats H et HSS sont les plus répandus) et il a été prouvé, en théorie et en pratique, qu'ils permettent de réduire substantiellement les besoins en mémoire et opération des calculs d'algèbre linéaire. Cependant, de nombreuses contraintes structurelles sont imposées sur les problèmes visés, ce qui peut limiter leur efficacité et leur applicabilité aux solveurs multifrontaux généraux. Nous proposons un format plat appelé Block Rang-Faible (BRF) basé sur un découpage naturel de la matrice en blocs et expliquons pourquoi il fournit toute la flexibilité nécéssaire à son utilisation dans un solveur multifrontal général, en terme de pivotage numérique et de parallélisme. Nous comparons le format BRF avec les autres et montrons que le format BRF ne compromet que peu les améliorations en mémoire et opération obtenues grâce aux approximations rang-faible. Une étude de stabilité montre que les approximations sont bien contrôlées par un paramètre numérique explicite appelé le seuil rang-faible, ce qui est critique dans l'optique de résoudre des systèmes linéaires creux avec précision. Ensuite, nous expliquons comment les factorisations exploitant le format BRF peuvent être efficacement implémentées dans les solveurs multifrontaux. Nous proposons plusieurs algorithmes de factorisation BRF, ce qui permet d'atteindre différents objectifs. Les algorithmes proposés ont été implémentés dans le solveur multifrontal MUMPS. Nous présentons tout d'abord des expériences effectuées avec des équations aux dérivées partielles standardes pour analyser les principales propriétés des algorithmes BRF et montrer le potentiel et la flexibilité de l'approche ; une comparaison avec un code basé sur le format HSS est également fournie. Ensuite, nous expérimentons le format BRF sur des problèmes variés et de grande taille (jusqu'à une centaine de millions d'inconnues), provenant de nombreuses applications industrielles. Pour finir, nous illustrons l'utilisation de notre approche en tant que préconditionneur pour la méthode du Gradient Conjugué. / We consider the solution of large sparse linear systems by means of direct factorization based on a multifrontal approach. Although numerically robust and easy to use (it only needs algebraic information: the input matrix A and a right-hand side b, even if it can also digest preprocessing strategies based on geometric information), direct factorization methods are computationally intensive both in terms of memory and operations, which limits their scope on very large problems (matrices with up to few hundred millions of equations). This work focuses on exploiting low-rank approximations on multifrontal based direct methods to reduce both the memory footprints and the operation count, in sequential and distributed-memory environments, on a wide class of problems. We first survey the low-rank formats which have been previously developed to efficiently represent dense matrices and have been widely used to design fast solutions of partial differential equations, integral equations and eigenvalue problems. These formats are hierarchical (H and Hierarchically Semiseparable matrices are the most common ones) and have been (both theoretically and practically) shown to substantially decrease the memory and operation requirements for linear algebra computations. However, they impose many structural constraints which can limit their scope and efficiency, especially in the context of general purpose multifrontal solvers. We propose a flat format called Block Low-Rank (BLR) based on a natural blocking of the matrices and explain why it provides all the flexibility needed by a general purpose multifrontal solver in terms of numerical pivoting for stability and parallelism. We compare BLR format with other formats and show that BLR does not compromise much the memory and operation improvements achieved through low-rank approximations. A stability study shows that the approximations are well controlled by an explicit numerical parameter called low-rank threshold, which is critical in order to solve the sparse linear system accurately. Details on how Block Low-Rank factorizations can be efficiently implemented within multifrontal solvers are then given. We propose several Block Low-Rank factorization algorithms which allow for different types of gains. The proposed algorithms have been implemented within the MUMPS (MUltifrontal Massively Parallel Solver) solver. We first report experiments on standard partial differential equations based problems to analyse the main features of our BLR algorithms and to show the potential and flexibility of the approach; a comparison with a Hierarchically SemiSeparable code is also given. Then, Block Low-Rank formats are experimented on large (up to a hundred millions of unknowns) and various problems coming from several industrial applications. We finally illustrate the use of our approach as a preconditioning method for the Conjugate Gradient.

Este trabalho trata do desenvolvimento de um material didático, sob a forma de cadernos (presentemente, em forma de capítulos), acompanhado de protótipo de circuito simples para testes experimentais, a ser utilizado no ensino de nível médio. O conteúdo reunido nos cadernos abrange o desenvolvimento analítico de tópicos pertinentes à física-matemática, esquema para a construção do protótipo e exemplos utilizando recursos computacionais. Mais especificamente, buscou-se enfatizar o ensino dos tópicos de equações e sistemas lineares, motivados por fenômenos físicos. Pretendeu-se explorar o aspecto experimental (com a construção e o uso de protótipo de circuitos simples), o analítico (com a resolução de equações e sistemas lineares, e com uma introdução à programação linear) e o computacional (com uso da planilha eletrônica). Em todos os conteúdos desenvolvidos, é dada especial ênfase à interpretação, à análise e à validação dos resultados. Com este material, procura-se oferecer ao professor um conjunto de atividades didático-pedagógicas, que possam estimular a sua atuação crítica e criativa. E que, também, propiciem a reflexão e a análise na identificação e resolução de problemas, a fim de desencadear processos cognitivos que levem o aluno a compreender as interrelações entre a física e a matemática. / This paper is about the development of a didatic material, under the way of notebooks (here, in chapters), accompained by the prototype of simple circuit for experimental tests, to be used in high school teaching. The issue brought in the notebooks comprehends the analytic development of the topics that belong to the physics- mathematics, scheme for the building of the prototype and examples with the use of computer resources. More specifically, applied to the teaching of the topics of equations and linear systems, motivated by physics phenomena. It was intended to explore the experimental aspect (with the building of simple circuit prototype), the analytic (with the resolution of equations and linear systems, with an introduction to the linear programming) and the computer (with the use of electronic chart). In all the topics developed, a special emphasis is given to the interpretation, analysis and validating of the results. With this material, it was intended to offer the teacher a set of didatic- pedagogical activities that can stimulate the critical and creative acting. And that can also provide the thinking and analysis in the identification and resolution of problems, with the aim of triggering cognitive processes that lead the student to understand the inter-relations between physics and mathematics.

Les systèmes sur puce sont de plus en plus complexes : ils intègrent des parties numériques, desparties analogiques et des capteurs ou actionneurs. SystemC et son extension SystemC AMSpermettent aujourd’hui de modéliser à haut niveau d’abstraction de tels systèmes. Ces outilsconstituent de véritables atouts dans une optique d’étude de faisabilité, d’exploration architecturale etde vérification du fonctionnement global des systèmes complexes hétérogènes et multiphysiques. Eneffet, les durées de simulation deviennent trop importantes pour envisager les simulations globales àbas niveau d’abstraction. De plus, les simulations basées sur l’utilisation conjointe de différents outilsprovoquent des problèmes de synchronisation. Les modèles de bas niveau, une fois crées par lesspécialistes des différents domaines peuvent toutefois être abstraits afin de générer des modèles dehaut niveau simulables sous SystemC/SystemC AMS en des temps de simulation réduits. Une analysedes modèles de calcul et des styles de modélisation possibles est d’abord présentée afin d’établir unlien avec les durées de simulation, ceci pour proposer un style de modélisation en fonction du niveaud’abstraction souhaité et de l’ampleur de la simulation à effectuer. Dans le cas des circuits analogiqueslinéaires, une méthode permettant de générer automatiquement des modèles de haut niveaud’abstraction à partir de modèles de bas niveau a été proposée. Afin d’évaluer très tôt dans le flot deconception la consommation d’un système, un moyen d’enrichir les modèles de haut niveaupréalablement générés est présenté. L’attention a ensuite été portée sur la modélisation à haut niveaudes systèmes multiphysiques. Deux méthodes y sont discutées : la méthode consistant à utiliser lecircuit équivalent électrique puis la méthode basée sur les bond graphs. En particulier, nous proposonsune méthode permettant de générer un modèle équivalent au bond graph à partir d’un modèle de basniveau. Enfin, la modélisation d’un système éolien est étudiée afin d’illustrer les différents conceptsprésentés dans cette thèse. / Systems on chip are more and more complex as they now embed not only digital and analog parts, butalso sensors and actuators. SystemC and its extension SystemC AMS allow the high level modeling ofsuch systems. These tools are efficient for feasibility study, architectural exploration and globalverification of heterogeneous and multiphysics systems. At low level of abstraction, the simulationdurations are too important. Moreover, synchronization problems appear when cosimulations areperformed. It is possible to abstract the low level models that are developed by the specialists of thedifferent domains to create high level models that can be simulated faster using SystemC/SystemCAMS. The models of computation and the modeling styles have been studied. A relation is shownbetween the modeling style, the model size and the simulation speed. A method that generatesautomatically the high level model of an analog linear circuit from its low level representation isproposed. Then, it is shown how to include in the high level model some information allowing thepower consumption estimation. After that, the multiphysics systems modeling is studied. Twomethods are discussed: firstly, the one that uses the electrical equivalent circuit, then the one based onthe bond graph approach. It is shown how to generate a bond graph equivalent model from a low levelrepresentation. Finally, the modeling of a wind turbine system is discussed in order to illustrate thedifferent concepts presented in this thesis.

Este trabalho trata do problema de controle H-infinito de uma classe de sistemas lineares com saltos Markovianos (MJLS) a tempo contínuo, onde a cadeia de Markov toma valores em um conjunto infinito enumerável. Um bounded real lemma (que chamamos JBRL) é desenvolvido, estabelecendo que a factibilidade de um conjunto infinito de desigualdades matriciais lineares (LMIs) interconectadas é necessária e suficiente para que um dado sistema seja estocasticamente estável (SS) e atenda a um desempenho H-infinito prescrito. O problema H-infinito estudado consiste na atenuação do efeito que perturbações estocásticas de energia finita causam na saída de um sistema, no pior caso. Neste problema, conhecido na literatura como "disturbance attenuation" (DA), assumimos ainda que o controlador somente tem acesso ao processo de saltos e a uma saída do sistema. Os controladores de interesse devem garantir que tanto a estabilidade (SS) quanto um desempenho H-infinito sejam observados no sistema em malha fechada - donde as condições impostas pelo JBRL são determinantes para a existência de soluções. Um importante aspecto dessa nova abordagem é que ferramentas tão fundamentais quanto o Complemento de Schur ou o Lema da Projeção, p.ex., não podem mais ser usados para manipular os conjuntos de LMIs infinitamente acopladas - tal dificuldade é contornada pela introdução de versões estendidas desses resultados, no início do trabalho. Um dos principais resultados deste trabalho caracteriza a existência de soluções através de dois problemas LMI complementares, um dos quais torna possível o design computacional de controladores. Por fim, são apresentados algoritmos para a construção prática de controladores, ótimos ou sub-ótimos, dando origem a um conjunto de ferramentas que, especialmente no caso em que a cadeia de Markov é finita, podem ser implementadas computacionalmente de maneira imediata. Mesmo no caso finito, os resultados da tese são mais fortes do que aqueles atualmente encontrados na literatura.

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES) / O objetivo deste trabalho é apresentar o método dos mínimos quadrados para resolver sistemas lineares sobredeterminados, ou seja, sistemas da forma Ax=b, em que A m×n , com m>n. Neste sentido, veremos como a resolução destes sistemas estão relacionados com encontrar a projeção ortogonal b sobre o subespaço gerado pelas colunas de A . Este tipo de sistema é usado ainda para modelar um problema de geoposicionamento, cujo objetivo é determinar a posição de um receptor que recebe o sinal de vários satélites. / The main goal of this work is to present the least squares method to solve overdetermined linear systems, that is, systems of the form Ax = b , where A m×n , with m > n . In this sense, we showed that the resolution of these systems is related to the orthogonal projection problem of b on the subspace generated by the columns of A. This type of system is used to model a problem of geo-positioning, whose objective is to determine the position of a receiver that receives the signal from several satellites.

Dans cette thèse, nous nous sommes penchés d’un point de vue à la foisthéorique et pratique sur la conception d’algorithmes et detechniques d’ordonnancement adaptées aux architectures complexes dessuperordinateurs modernes. Nous nous sommes en particulier intéressésà l’utilisation mémoire et la gestion des communications desalgorithmes pour le calcul haute performance (HPC). Nous avonsexploité l’hétérogénéité des superordinateurs modernes pour améliorerles performances du calcul matriciel. Nous avons étudié lapossibilité d’alterner intelligemment des étapes de factorisation LU(plus rapide) et des étapes de factorisation QR (plus stablenumériquement mais plus deux fois plus coûteuses) pour résoudre unsystème linéaire dense. Nous avons amélioré les performances desystèmes d’exécution dynamique à l’aide de pré-calculs statiquesprenants en compte l’ensemble du graphe de tâches de la factorisationCholesky ainsi que l’hétérogénéité de l’architecture. Nous noussommes intéressés à la complexité du problème d’ordonnancement degraphes de tâches utilisant de gros fichiers d’entrée et de sortiesur une architecture hétérogène avec deux types de ressources,utilisant chacune une mémoire spécifique. Nous avons conçu denombreuses heuristiques en temps polynomial pour la résolution deproblèmes généraux que l’on avait prouvés NP-complet aupréalable. Enfin, nous avons conçu des algorithmes optimaux pourordonnancer un graphe de différentiation automatique sur uneplateforme avec deux types de mémoire : une mémoire gratuite maislimitée et une mémoire coûteuse mais illimitée. / Throughout this thesis, we have designed memory-aware algorithms and scheduling techniques suitedfor modern memory architectures. We have shown special interest in improving the performance ofmatrix computations on multiple levels. At a high level, we have introduced new numerical algorithmsfor solving linear systems on large distributed platforms. Most of the time, these linear solvers rely onruntime systems to handle resources allocation and data management. We also focused on improving thedynamic schedulers embedded in these runtime systems by adding static information to their decisionprocess. We proposed new memory-aware dynamic heuristics to schedule workflows, that could beimplemented in such runtime systems.Altogether, we have dealt with multiple state-of-the-art factorization algorithms used to solve linearsystems, like the LU, QR and Cholesky factorizations. We targeted different platforms ranging frommulticore processors to distributed memory clusters, and worked with several reference runtime systemstailored for these architectures, such as P A RSEC and StarPU. On a theoretical side, we took specialcare of modelling convoluted hierarchical memory architectures. We have classified the problems thatare arising when dealing with these storage platforms. We have designed many efficient polynomial-timeheuristics on general problems that had been shown NP-complete beforehand.

O objetivo deste estudo é apresentar uma revisão sobre técnicas de redução da ordem de modelos dinâmicos lineares e invariantes no tempo. Com a implementação de tais técnicas, o autor mostra que é possível reproduzir as principais características da resposta de um modelo de alta ordem através de um modelo de ordem reduzida com menor número de graus de liberdade. Uma metodologia para redução da ordem de modelos de sistemas dinâmicos foi apresentada. Os processos envolvidos nesta metodologia foram descritos, os quais são: técnicas para realizar projeções do sistema em diferentes bases, selecionar os graus de liberdade que são bons candidatos a eliminação, eliminar graus de liberdade do modelo completo e implementar correções na resposta do modelo reduzido. Foram apresentadas maneiras de quantificar as similitudes entre as respostas dos modelos completo e reduzido através de métricas de representatividade. Para implementar e estudar as técnicas de redução apresentadas, o autor elaborou dois modelos para estudo de caso: um modelo para estudo da dinâmica vertical de um veículo de passeio e outro modelo para estudo da dinâmica longitudinal de um trem. Diferentes técnicas de redução foram implementadas a partir dos dois modelos para estudo de caso e os resultados foram comparados através das métricas de representatividade. O critério proposto pelo autor para quantificar desempenho de um modelo reduzido foi utilizado para determinar de maneira objetiva o modelo reduzido mais adequado para cada aplicação. Como contribuição neste trabalho, o autor propôs uma definição de desempenho de um modelo reduzido e um método para quantificar o mesmo, além de duas novas métricas para mensurar a capacidade do modelo reduzido em reproduzir os máximos sobre-sinais e tempos de acomodação do modelo completo. / The objective of this work is to present a revision about model order reduction techniques applied to linear, time invariant dynamic systems. With the implementation of these techniques, the author shows that it is possible to reproduce the main characteristics of the response of a high order dynamic system using a reduced order model with fewer degrees of freedom. A model order reduction methodology was presented. The processes which are involved in this methodology were described, which are: techniques for projection onto different basis, selection of the most suitable degrees of freedom to be reduced, elimination of degrees of freedom from the high order model, implementation of corrections at the reduced model response. The author showed ways to quantify the similarities between the responses of the complete and reduced models using representativeness metrics. In order to implement and study the presented model order reduction techniques, the author developed two case study models: one model to study the vertical dynamics of a passenger car and another model to study the longitudinal dynamics of a train. Different model order reduction techniques were implemented and its results were compared using representativeness metrics and the performance of the reduced models. The criteria proposed by the author to quantify the performance of a reduced order model was used to objectively determine the most suitable reduced order model for each application. The author proposed, as contribution at this work, a definition of the reduced order model performance, a method to quantify its performance and two new metrics to measure the capacity of the reduced model to reproduce the overshoots and settling times of the complete model.