Este trabalho propõe uma nova abordagem, baseada em wavelets, para o método Multigrid Algébrico (WAMG). Nesta nova abordagem, a Transformada Discreta Wavelet é aplicada na matriz de coeficientes do sistema linear gerando uma aproximação dessa matriz em cada nível do processo de multiresolução. As vantagens da nova abordagem, que incluem maior facilidade de paralelização e menor tempo de montagem, são apresentadas com detalhes e uma análise quantitativa de convergência do método WAMG é realizada a partir da sua aplicação em problemas testes. O WAMG também é testado como pré- condicionador para métodos iterativos no subespaço de Krylov na análise magnetostática e magnetodinâmica (regime permanente senoidal) pelo Método dos Elementos Finitos, e em matrizes esparsas extraidas das coleções Matrix Market e da Universidade da Flórida. São apresentados resultados numéricos comparando o WAMG com o Multigrid Algébrico tradicional e com os pré-condicionadores baseados em decomposições incompletas de Cholesky e LU. / In this work we propose a wavelet-based algebraic multigrid method (WAMG) as a linear system solver as well as a prediconditioner for Krylov subspace methods. It is a new approach for the Algebraic Multigrid method (AMG), which considers the use of Discrete Wavelet Transform (DWT) in the construction of a hierarchy of matrices. The two-dimensional DWT is applied to produce an approximation of the matrix in each level of the wavelets multiresolution decomposition process. The main advantages of this new approach are presented and a quantitative analysis of its convergence is shown after its application in some test problems. The WAMG also is tested as a preconditioner for Krylov subspace methods in problems with sparse matrices, in nonlinear magnetic field problems and in 3D time-harmonic Electromagnetic Edge-based Finite Element Analysis. Numerical results are presented comparing the WAMG with the standard Algebraic Multigrid method and with the preconditioners based on the incomplete Cholesky and LU decompositions.

A Tomografia de Impedância Elétrica é uma técnica de obtenção de imagens do interior de um corpo, mediante grandezas elétricas medidas em sua superfície. Matematicamente, a técnica determina as distribuições de condutividades e permissividades elétricas num dado modelo do corpo, as quais reproduzem as medidas de correntes e potenciais elétricos em eletrodos fixados ao corpo. Nesse caso, as distribuições de condutividades e permissividades representam a solução de um problema não-linear e mal-posto, o qual é instável e apresenta mínimos locais, requerendo técnicas de inversão específicas. Um sistema de Tomografia de Impedância Elétrica aplicado à obtenção de imagens de valores absolutos possui, atualmente, limitações. São algumas delas a obtenção de distribuições de propriedades suaves e de valores geralmente subestimados, a sensibilidade elevada ao erro de posicionamento dos eletrodos (com relação ao modelo) e ao erro nos valores de parâmetros de contato, a sensibilidade elevada aos ruídos de medição, os tempos elevados de processamento, dentre outros. Com o intuito de abordar as limitações, melhorando o desempenho do sistema de Tomografia de Impedância Elétrica de imagens absolutas, são então propostas e avaliadas ferramentas baseadas no Método de Otimização Topológica no atual trabalho. Mais especificamente, avaliam-se: 1) um método para obtenção de parâmetros de contato em conjunto com uma imagem e um método de regularização baseado no controle explícito da variação espacial da imagem, 2) uma formulação para acomodação de incertezas, 3) uma formulação para correção do posicionamento de eletrodos, 4) uma formulação para projeto de eletrodos e 5) um novo solucionador de sistemas lineares de larga escala. Os resultados mostram a efetividade da maioria das técnicas propostas, e sugerem os novos tópicos de pesquisa em Tomografia de Impedância Elétrica. / Electrical Impedance Tomography images the interior of a body based on electrical quantities measured on the surface of it. Mathematically, the technique finds the electric admittivity distribution in a given body model which reproduces the boundary measurements of electric currents and potentials on electrodes attached to that body. Therefore, the admittivity distribution is the solution of a non-linear and ill-posed problem, which is unstable and have local minima, requiring specific inversion techniques. Electrical Impedance Tomography systems which obtain images corresponding to absolute values present limitations. For instance, the results are usually smooth and underestimated, the sensitivity to errors in the positioning of electrodes and wrong values of contact parameters and the sensitivity to measurement noise are high, the data processing time is high, etc. In this work, techniques based on the Topology Optimization Method intended for improving the performance of the particular Electrical Impedance Tomography system applied to absolute images are proposed and evaluated. More specifically, the following techniques are evaluated: 1) a method intended to obtain contact parameters together with images, and a regularization method based on the explicit control of the spatial variation regarding the image, 2) a formulation applied to handle uncertainties, 3) a formulation applied to correct the position of electrodes, 4) a formulation applied to design electrodes, 5) and a new solver for large-scale linear systems. Results show the effectiveness of most of the proposed techniques, and suggest new research topics in Electrical Impedance Tomography.

Cette thèse s'inscrit dans le cadre de la conception des systèmes mécatroniques. Les travaux se positionnent dans les premières phases du cycle de conception, là où les principaux efforts méthodologiques sont à mener pour améliorer la qualité et la fonctionnalité des produits, et reposent sur le prototypage virtuel (modélisation et simulation). Une approche méthodologique envisageable est de reformuler le problème de conception sous une forme inverse, pour directement utiliser les spécifications du cahier des charges, usuellement exprimées sur les sorties, pour calculer les inconnues du problème. Dans ce contexte, le laboratoire Ampère développe une méthodologie de conception et dimensionnement, basée sur l'inversion de modèle, utilisant le formalisme bond graph, pour proposer une démarche reposant sur des critères dynamiques et énergétiques, et dont la principale originalité est sa phase d'analyse structurelle, permettant une hiérarchisation d’analyse suivant différents niveaux de la structure physique du modèle (topologie, phénoménologie, paramétrage). L'objectif est de contribuer au développement de cette méthodologie, en l’étendant aux modèles appartenant à la classe des systèmes singuliers, porté par la velléité de décliner la démarche à la conception fonctionnelle du châssis automobile et de ses sous-systèmes, comportant un certain nombre d'abstractions de modélisation et d'idéalisations. Cette déclinaison est proposée, d’une part, au niveau de la structure du modèle et, d’autre part, à un niveau considérant sa phénoménologie et ses lois de comportement. Elle requiert la mise en place préalable d'un référentiel algébrique, essentiellement issu de travaux sur la commande des systèmes, pour constituer une base de validation des extensions graphiques (digraphe et bond graph) proposées. En plus de la généralisation qu'ils constituent à la classe des modèles singuliers, les présents travaux proposent une uniformisation des précédentes approches de la méthodologie, originellement appliquées respectivement aux modèles directs et aux modèles inverses, de sorte qu'il n'est à présent plus nécessaire de les différencier. / The context of this PhD thesis is the modeling and design of mechatronic systems. The study is positioned in the early design stage of the conception cycle (V-Cycle), where the main efforts have to be produced in terms of methodology, to enhance the quality and the functionality of the products, and based on virtual prototyping (modeling and simulation). One of the possible methodology is to reformulate the design problem as an inverse problem, in order to directly use the design specification of the product, usually given in terms of the system outputs, and then solve the design problem. In this context, the Ampere laboratory of INSA Lyon has developed a conception and design methodology, based on inverse approach and using the bond graph formalism, to propose a step-by-step method based on dynamic and energetic criteria, with a structural analysis phase that allows hierarchical analysis steps, depending on the structural physical layout of the model (topological, phenomenological, parameter set). The aim of the present works is to contribute to the development of this methodology, by enhancing it to the class of descriptor systems. This choice is led by the aim to apply the methodology in the context of chassis design and vehicle dynamics, where, among other, multi-body models represented as a differential-algebraic equation (DAE) system could occur. The contributions are proposed at the level of the topology of the model, as well as at the level of the phenomenological / behavioral aspects. A preliminary step is to enhance the existing algebraic framework to support graphical extension (in term of digraph and bond graph). The overall methodological extensions allow, firstly, a generalization of the approach to the class of descriptor systems, and, secondly, to reach a standardization of the procedures, previously dedicated to direct or inverse models, so as no mandatory differences between those models have to be done anymore.

Este trabalho propõe uma nova abordagem, baseada em wavelets, para o método Multigrid Algébrico (WAMG). Nesta nova abordagem, a Transformada Discreta Wavelet é aplicada na matriz de coeficientes do sistema linear gerando uma aproximação dessa matriz em cada nível do processo de multiresolução. As vantagens da nova abordagem, que incluem maior facilidade de paralelização e menor tempo de montagem, são apresentadas com detalhes e uma análise quantitativa de convergência do método WAMG é realizada a partir da sua aplicação em problemas testes. O WAMG também é testado como pré- condicionador para métodos iterativos no subespaço de Krylov na análise magnetostática e magnetodinâmica (regime permanente senoidal) pelo Método dos Elementos Finitos, e em matrizes esparsas extraidas das coleções Matrix Market e da Universidade da Flórida. São apresentados resultados numéricos comparando o WAMG com o Multigrid Algébrico tradicional e com os pré-condicionadores baseados em decomposições incompletas de Cholesky e LU. / In this work we propose a wavelet-based algebraic multigrid method (WAMG) as a linear system solver as well as a prediconditioner for Krylov subspace methods. It is a new approach for the Algebraic Multigrid method (AMG), which considers the use of Discrete Wavelet Transform (DWT) in the construction of a hierarchy of matrices. The two-dimensional DWT is applied to produce an approximation of the matrix in each level of the wavelets multiresolution decomposition process. The main advantages of this new approach are presented and a quantitative analysis of its convergence is shown after its application in some test problems. The WAMG also is tested as a preconditioner for Krylov subspace methods in problems with sparse matrices, in nonlinear magnetic field problems and in 3D time-harmonic Electromagnetic Edge-based Finite Element Analysis. Numerical results are presented comparing the WAMG with the standard Algebraic Multigrid method and with the preconditioners based on the incomplete Cholesky and LU decompositions.

In this thesis, we present efficient deterministic algorithms for polynomial matrix computation problems, including the computation of order basis, minimal kernel basis, matrix inverse, column basis, unimodular completion, determinant, Hermite normal form, rank and rank profile for matrices of univariate polynomials over a field. The algorithm for kernel basis computation also immediately provides an efficient deterministic algorithm for solving linear systems. The algorithm for column basis also gives efficient deterministic algorithms for computing matrix GCDs, column reduced forms, and Popov normal forms for matrices of any dimension and any rank. We reduce all these problems to polynomial matrix multiplications. The computational costs of our algorithms are then similar to the costs of multiplying matrices, whose dimensions match the input matrix dimensions in the original problems, and whose degrees equal the average column degrees of the original input matrices in most cases. The use of the average column degrees instead of the commonly used matrix degrees, or equivalently the maximum column degrees, makes our computational costs more precise and tighter. In addition, the shifted minimal bases computed by our algorithms are more general than the standard minimal bases.

In this thesis, we present efficient deterministic algorithms for polynomial matrix computation problems, including the computation of order basis, minimal kernel basis, matrix inverse, column basis, unimodular completion, determinant, Hermite normal form, rank and rank profile for matrices of univariate polynomials over a field. The algorithm for kernel basis computation also immediately provides an efficient deterministic algorithm for solving linear systems. The algorithm for column basis also gives efficient deterministic algorithms for computing matrix GCDs, column reduced forms, and Popov normal forms for matrices of any dimension and any rank. We reduce all these problems to polynomial matrix multiplications. The computational costs of our algorithms are then similar to the costs of multiplying matrices, whose dimensions match the input matrix dimensions in the original problems, and whose degrees equal the average column degrees of the original input matrices in most cases. The use of the average column degrees instead of the commonly used matrix degrees, or equivalently the maximum column degrees, makes our computational costs more precise and tighter. In addition, the shifted minimal bases computed by our algorithms are more general than the standard minimal bases.

We describe heterogeneous multi-CPU and multi-GPU implementations of Jacobi's iterative method for the 2-D Poisson equation on a structured grid, in both single- and double-precision. Properly tuned, our best implementation achieves 98% of the empirical streaming GPU bandwidth (66% of peak) on a NVIDIA C1060. Motivated to find a still faster implementation, we further consider "wildly asynchronous" implementations that can reduce or even eliminate the synchronization bottleneck between iterations. In these versions, which are based on the principle of a chaotic relaxation (Chazan and Miranker, 1969), we simply remove or delay synchronization between iterations, thereby potentially trading off more flops (via more iterations to converge) for a higher degree of asynchronous parallelism. Our relaxed-synchronization implementations on a GPU can be 1.2-2.5x faster than our best synchronized GPU implementation while achieving the same accuracy. Looking forward, this result suggests research on similarly "fast-and-loose" algorithms in the coming era of increasingly massive concurrency and relatively high synchronization or communication costs.

L’identité de Ward est une relation qui permet d’identifier unmilieu de propagation linéaire dissipatif, c'est-à-dire d'estimer des paramètres qui le caractérisent. Dans les travaux exposés, cette identité est utilisée pour proposer de nouveaux modèles d’observation caractérisant un contexte d’estimation qualifié de passif : les sources qui excitent le système ne sont pas contrôlées par l’utilisateur. La théorie de l’estimation/détection dans ce contexte est étudiée et des analyses de performances sont menées sur divers estimateurs. La portée applicative des méthodes proposées concerne le domaine du Structural Health Monitoring (SHM), c’est-à-dire le suivi de l’état de santé desbâtiment, des ponts... L'approche est développée pour la modalité acoustique aux fréquences audibles, cette dernière s'avérant complémentaire des techniques de l’état de l’art du SHM et permettant entre autre, d’accéder à des paramètres structuraux et géométriques. Divers scénarios sont illustrés par la mise en oeuvre expérimentale des algorithmes développés et adaptés à des contraintes de calculs embarqués sur un réseau de capteurs autonome. / Ward identity is a relationship that enables damped linear system identification, ie the estimation its caracteristic properties. This identity is used to provide new observation models that are available in an estimation context where sources are uncontrolled by the user. An estimation and detection theory is derived from these models and various performances studies areconducted for several estimators. The reach of the proposed methods is extended to Structural Health Monitoring (SHM), that aims at measuring and tracking the health of buildings, such as a bridge or a sky-scraper for instance. The acoustic modality is chosen as it provides complementary parameters estimation to the state of the art in SHM, such as structural and geometrical parameters recovery. Some scenarios are experimentally illustrated by using the developed algorithms, adapted to fit the constrains set by embedded computation on anautonomous sensor network.

L'arithmétique par intervalles permet de calculer et simultanément vérifier des résultats. Cependant, une application naïve de cette arithmétique conduit à un encadrement grossier des résultats. De plus, de tels calculs peuvent être lents.Nous proposons des algorithmes précis et des implémentations efficaces, utilisant l'arithmétique par intervalles, dans le domaine de l'algèbre linéaire. Deux problèmes sont abordés : la multiplication de matrices à coefficients intervalles et la résolution vérifiée de systèmes linéaires. Pour le premier problème, nous proposons deux algorithmes qui offrent de bons compromis entre vitesse et précision. Pour le second problème, nos principales contributions sont d'une part une technique de relaxation, qui réduit substantiellement le temps d'exécution de l'algorithme, et d'autre part l'utilisation d'une précision étendue en quelques portions bien choisies de l'algorithme, afin d'obtenir rapidement une grande précision. / Interval arithmetic is a means to compute verified results. However, a naive use of interval arithmetic does not provide accurate enclosures of the exact results. Moreover, interval arithmetic computations can be time-consuming. We propose several accurate algorithms and efficient implementations in verified linear algebra using interval arithmetic. Two fundamental problems are addressed, namely the multiplication of interval matrices and the verification of a floating-point solution of a linear system. For the first problem, we propose two algorithms which offer new tradeoffs between speed and accuracy. For the second problem, which is the verification of the solution of a linear system, our main contributions are twofold. First, we introduce a relaxation technique, which reduces drastically the execution time of the algorithm. Second, we propose to use extended precision for few, well-chosen parts of the computations, to gain accuracy without losing much in term of execution time.

A Tomografia de Impedância Elétrica é uma técnica de obtenção de imagens do interior de um corpo, mediante grandezas elétricas medidas em sua superfície. Matematicamente, a técnica determina as distribuições de condutividades e permissividades elétricas num dado modelo do corpo, as quais reproduzem as medidas de correntes e potenciais elétricos em eletrodos fixados ao corpo. Nesse caso, as distribuições de condutividades e permissividades representam a solução de um problema não-linear e mal-posto, o qual é instável e apresenta mínimos locais, requerendo técnicas de inversão específicas. Um sistema de Tomografia de Impedância Elétrica aplicado à obtenção de imagens de valores absolutos possui, atualmente, limitações. São algumas delas a obtenção de distribuições de propriedades suaves e de valores geralmente subestimados, a sensibilidade elevada ao erro de posicionamento dos eletrodos (com relação ao modelo) e ao erro nos valores de parâmetros de contato, a sensibilidade elevada aos ruídos de medição, os tempos elevados de processamento, dentre outros. Com o intuito de abordar as limitações, melhorando o desempenho do sistema de Tomografia de Impedância Elétrica de imagens absolutas, são então propostas e avaliadas ferramentas baseadas no Método de Otimização Topológica no atual trabalho. Mais especificamente, avaliam-se: 1) um método para obtenção de parâmetros de contato em conjunto com uma imagem e um método de regularização baseado no controle explícito da variação espacial da imagem, 2) uma formulação para acomodação de incertezas, 3) uma formulação para correção do posicionamento de eletrodos, 4) uma formulação para projeto de eletrodos e 5) um novo solucionador de sistemas lineares de larga escala. Os resultados mostram a efetividade da maioria das técnicas propostas, e sugerem os novos tópicos de pesquisa em Tomografia de Impedância Elétrica. / Electrical Impedance Tomography images the interior of a body based on electrical quantities measured on the surface of it. Mathematically, the technique finds the electric admittivity distribution in a given body model which reproduces the boundary measurements of electric currents and potentials on electrodes attached to that body. Therefore, the admittivity distribution is the solution of a non-linear and ill-posed problem, which is unstable and have local minima, requiring specific inversion techniques. Electrical Impedance Tomography systems which obtain images corresponding to absolute values present limitations. For instance, the results are usually smooth and underestimated, the sensitivity to errors in the positioning of electrodes and wrong values of contact parameters and the sensitivity to measurement noise are high, the data processing time is high, etc. In this work, techniques based on the Topology Optimization Method intended for improving the performance of the particular Electrical Impedance Tomography system applied to absolute images are proposed and evaluated. More specifically, the following techniques are evaluated: 1) a method intended to obtain contact parameters together with images, and a regularization method based on the explicit control of the spatial variation regarding the image, 2) a formulation applied to handle uncertainties, 3) a formulation applied to correct the position of electrodes, 4) a formulation applied to design electrodes, 5) and a new solver for large-scale linear systems. Results show the effectiveness of most of the proposed techniques, and suggest new research topics in Electrical Impedance Tomography.