Change of the congruence canonical form of 2-by-2 and 3-by-3 matrices under perturbations and bundles of matrices under congruence

We construct the Hasse diagrams $G_2$ and $G_3$ for the closure ordering on the sets of congruence classes of $2\times 2$ and $3\times 3$ complex matrices. In other words, we construct two directed graphs whose vertices are $2\times 2$ or, respectively, $3\times 3$ canonical matrices under congruence and there is a directed path from $A$ to $B$ if and only if $A$ can be transformed by an arbitrarily small perturbation to a matrix that is congruent to $B$. A bundle of matrices under congruence is defined as a set of square matrices $A$ for which the pencils $A+\lambda A^T$ belong to the same bundle under strict equivalence. In support of this definition, we show that all matrices in a congruence bundle of $2\times 2$ or $3\times 3$ matrices have the same properties with respect to perturbations. We construct the Hasse diagrams $G_2^{\rm B}$ and $G_3^{\rm B}$ for the closure ordering on the sets of congruence bundles of $2\times 2$ and, respectively, $3\times 3$ matrices. We find the isometry groups of $2\times 2$ and $3\times 3$ congruence canonical matrices.Comment: 34 page

Digital Filters and Signal Processing

Digital filters, together with signal processing, are being employed in the new technologies and information systems, and are implemented in different areas and applications. Digital filters and signal processing are used with no costs and they can be adapted to different cases with great flexibility and reliability. This book presents advanced developments in digital filters and signal process methods covering different cases studies. They present the main essence of the subject, with the principal approaches to the most recent mathematical models that are being employed worldwide

Determination of Design of Optimal Actuator Location Based on Control Energy

The thesis deals with the selection of the sets of inputs and outputs using the energy properties of the controllability and observability of a system and aims to define input and output structures which require minimization of the energy for control and state reconstruction. Such a study explores the energy dimension of the properties of controllability and observability, develops computations for the controllability and observability Gramians for stable and unstable systems and examines measures of the degree of controllability and observability properties using SVD (Singular Value Decomposition) of Gramians to compute the maximal and minimal energy requirements. These characterize the relative degree of controllability and observability under conditions where the available energy is constrained. The notion of energy surfaces in the state space is introduced and this enables the characterization of restricted notions of controllability and observability when the available energy is bounded. The maximal and minimal energy requirements for different input vectors is demonstrated and this provides the basis for the development of strategies and methodologies for selection of systems of inputs and outputs to minimize the energy required for control, respectively state reconstruction. These results enable the development of input, output structure selection methodology using a novel optimization method. This thesis contributes in the further development of the area of systems, or global instrumentation, developed so far based on the assignment of structural characteristics by incorporating the role of energy requirements. The research provides energy based tools for the selection of input and outputs schemes with a main criterion the minimization of the energy required for control and observation and thus provide an alternative approach based on quantitative system properties in characterizing control and state observation as functions of given sets of inputs and output sets. The methodologies developed may be used as design tools where apart from energy requirements other design criteria may be also incorporated for the selection of inputs and outputs. The methodology that is used is based on linear systems theory and tools from numerical linear algebra. The solution to the problems considered here is an integral part of the effort to develop an integrated approach to control and global process instrumentation

Some remarks on semi-classical analysis on two-step Nilmanifolds

In this paper, we present recent results about the developement of a semiclassical approach in the setting of nilpotent Lie groups and nilmanifolds. We focus on two-step nilmanifolds and exhibit some properties of the weak limits of sequence of densities associated with eigenfunctions of a sub-Laplacian. We emphasize the influence of the geometry on these properties

Parametric reduced-order aeroelastic modelling for analysis, dynamic system interpolation and control of flexible aircraft

This work presents an integral framework to derive aeroelastic models for very flexible aircraft that can be used in design routines, operational envelope analysis and control applications. Aircraft are modelled using a nonlinear geometrically-exact beam model coupled with an Unsteady Vortex-Lattice Method aerodynamic solver, capable of capturing important nonlinear couplings and effects that significantly impact the flight characteristics of very flexible aircraft. Then, complete linearised expressions of the aircraft system about trim reference conditions at possibly large deformations are presented. The nature of the aerodynamic models results in a high-dimensional system that requires of model reduction methods for efficient analysis and manipulation. Krylov-subspace model reduction methods are implemented to reduce the dimensionality of the multi-input multi-output linearised aerodynamic model and achieve a very significant reduction in the size of the size of the system. The reduced aerodynamic model is then coupled with a modal expression of the linearised beam model, resulting in a compact aeroelastic state-space that can be efficiently used on desktop hardware for linear analysis or as part of internal control models. These have been used to explore the design space of a very flexible wing with complex aeroelastic properties to determine the flutter boundaries, for which experimental data has become available that validates the methods presented herein. Additionally, they have been integrated in a model predictive control framework, where the reduced linear aerodynamic model is part of the control model, and the simulation plant is the nonlinear flight dynamic/aeroelastic model connected as a hardware-in-the-loop platform. Finally, in order to accelerate the design space exploration of very flexible structures, state-space interpolation methods are sought to obtain, with a few linearised models sampled across the domain, interpolated state-spaces anywhere in the parameter-space in a fast and accurate manner. The performance of the interpolation schemes is heavily dependent on the location of the sampling points on the design space, therefore, a novel adaptive Bayesian sampling scheme is presented to choose these points in an optimal approach that minimises the interpolation error function.Open Acces

Some remarks on semi-classical analysis on two-step Nilmanifolds

In this paper, we present recent results about the developement of a semiclassical approach in the setting of nilpotent Lie groups and nilmanifolds. We focus on two-step nilmanifolds and exhibit some properties of the weak limits of sequence of densities associated with eigenfunctions of a sub-Laplacian. We emphasize the influence of the geometry on these properties

Stratification theory of matrix pairs under equivalence and contragredient equivalence

We develop the theory of perturbations of matrix pencils basing on their miniversal deformations. Several applications of this theory are given. All possible Kronecker pencils that are canonical forms of pencils in an arbitrary small neighbourhood of a given pencil were described by A. Pokrzywa (Linear Algebra Appl., 1986). His proof is very abstract and unconstructive. Even more abstract proof of Pokrzywa’s theorem was given by K. Bongartz (Advances in Mathematics, 1996); he uses the representation theory of finite dimensional algebras. The main purpose of this thesis is to give a direct, constructive, and rather elementary proof of Pokrzywa’s theorem. We first show that it is sufficient to prove Pokrzywa’s theorem only for pencils that are direct sums of at most two indecomposable Kronecker pencils. Then we prove Pokrzywa’s theorem for such pencils. The latter problem is very simplified due to the following observation: it is sufficient to find Kronecker's canonical forms of only those pencils that are obtained by miniversal perturbations of a given pencil. We use miniversal deformations of matrix pencils that are given by M. I. García-Planas and V. V. Sergeichuk (Linear Algebra Appl., 1999) because their deformations have many zero entries unlike the miniversal deformations given by A. Edelman, E. Elmroth, and B. Kagstrom (SIAM J. Matrix Anal. Appl., 1997). Thus, we give not only all possible Kronecker’s canonical forms, but also the corresponding deformations of a given pencil, which is important for applications of this theory. P. Van Dooren (Linear Algebra Appl., 1979) constructed an algorithm for computing all singular summands of Kronecker’s canonical form of a matrix pencil. His algorithm uses only unitary transformations, which improves its numerical stability. We extend Van Dooren’s algorithm both to square complex matrices under consimilarity transformations and to pairs of complex matrices under mixed equivalence. We describe all pairs (A, B) of m-by-n and n-by-m complex matrices for which the product CD is a versal deformation of AB, in which (C, D) is the miniversal deformation of (A, B) under contragredient equivalence given by M. I. García-Planas and V. V. Sergeichuk (Linear Algebra Appl., 1999). We find all canonical matrix pairs (A, B) under contragredient equivalence, for which the first order induced perturbations are nonzero for all nonzero miniversal deformations of (A, B). This problem arises in the theory of differential matrix equations dx= ABx. A complex matrix pencil is called structurally stable if there exists its neighbourhood in which all pencils are strictly equivalent to it. We describe all complex matrix pencils that are structurally stable. We show that there are no pairs of complex matrices that are structurally stable with respect to contragredient equivalence.Es desenvolupa la teoria de pertorbacions de feixos de matrius a partir de les seves deformacions miniversals. Es donen diverses aplicacions d'aquesta teoria. A. Pokrzywa (Linear Algebra Appl., 1986) va descriure tots els possibles feixos en la seva forma de Kronecker que són formes canòniques dels feixos que es poden trobar en un petit entorn arbitrari d'un feix prèviament determinat. La demostració que presentava és molt abstracta i no constructiva. K. Bongartz (Advances in Mathematics, 1996) va donar una demostració encara més abstracta del teorema de Pokrzywa; utilitzant resultats de la teoria de representació d'àlgebres de dimensió finita. L’objectiu principal de aquesta tesi és presentar una demostració directa, constructiva i bastant elemental del teorema de Pokrzywa. Primer, es demostra que per a provar el teorema de Pokrzywa és suficient provar-lo solament per a feixos que són sumes directes de, com màxim, dos feixos de Kronecker indescomponibles. Per a continuació, provar el teorema de Pokrzywa per aquests feixos. L’últim problema es simplifica molt degut a la següent observació: és suficient per trobar les formes canòniques de Kronecker de només aquells feixox que s’obtenen de deformacions miniversals d’un feix determinat. Utilitzem les deformacions de feixos de matrius obtingudes per MI García-Planas i VV Sergeichuk (Linear Algebra Appl., 1999) perquè les seves deformacions tenen moltes entrades nul·les, a diferència de les deformacions miniversals obtingudes per A. Edelman, E. Elmroth i B. Kagstrom (SIAM J. Matrix Anal. Appl., 1997). Per tant, no solament donem totes les formes canòniques de Kronecker possibles, sinó també les deformacions corresponents a un feix prèviament fixat, la qual cosa és important per a les aplicacions d’aquesta teoria. P. Van Dooren (Linear Algebra Appl., 1979) va construir un algoritme per calcular tots els sumands singulars de la forma canònica de Kronecker, d’un feix de matrius. El seu algoritme utilitza solament transformacions unitàries, el que millora la seva estabilitat numèrica. Estenem l’algoritme de Van Dooren tant a matrius complexes quadrades respecte transformacions de cosimilaritat com a parells de matrius complexes respecte l’equivalència mixta. Descrivim tots els parells (A, B) de matrius complexes m per n i n per m, per les quals el producte CD és una deformació versal de AB, en la que (C, D) és la deformació miniversal de (A, B) respecte l’equivalència contragredient donada per MI García-Planas y VV Sergeichuk (Linear Algebra Appl., 1999). Descrivim tots los pares de matrius canòniques (A, B) respecte l’equivalència contragredient, per les quals les pertorbacions de primer ordre induïdes són diferents de cero para totes les deformacions miniversals no nul·les d¿(A, B). Aquest problema apareix en la teoria de les equacions matricials diferencials dx = ABx. Un feix de matrius complexes es diu estructuralment estable si existeix un entorn en el que tots els feixos són equivalents a ell respecte una relació d’equivalència considerada. Descrivim tots els feixos de matrius complexes que són estructuralment estables respecte la equivalència estricta. Mostrem que no hi ha parelles de matrius complexes que són estructuralment estables respecto l’equivalència contragredient.Postprint (published version

Uso de riscos na validação de sistemas baseados em componentes

Orientadores: Eliane Martins, Henrique Santos do Carmo MadeiraTese (doutorado) - Universidade Estadual de Campinas, Instituto de ComputaçãoResumo: A sociedade moderna está cada vez mais dependente dos serviços prestados pelos computadores e, conseqüentemente, dependente do software que está sendo executado para prover estes serviços. Considerando a tendência crescente do desenvolvimento de produtos de software utilizando componentes reutilizáveis, a dependabilidade do software, ou seja, a segurança de que o software irá funcionar adequadamente, recai na dependabilidade dos componentes que são integrados. Os componentes são normalmente adquiridos de terceiros ou produzidos por outras equipes de desenvolvimento. Dessa forma, os critérios utilizados na fase de testes dos componentes dificilmente estão disponíveis. A falta desta informação aliada ao fato de se estar utilizando um componente que não foi produzido para o sistema e o ambiente computacional específico faz com que a reutilização de componentes apresente um risco para o sistema que os integra. Estudos tradicionais do risco de um componente de software definem dois fatores que caracteriza o risco, a probabilidade de existir uma falha no componente e o impacto que isso causa no sistema computacional. Este trabalho propõe o uso da análise do risco para selecionar pontos de injeção e monitoração para campanhas de injeção de falhas. Também propõe uma abordagem experimental para a avaliação do risco de um componente para um sistema. Para se estimar a probabilidade de existir uma falha no componente, métricas de software foram combinadas num modelo estatístico. O impacto da manifestação de uma falha no sistema foi estimado experimentalmente utilizando a injeção de falhas. Considerando esta abordagem, a avaliação do risco se torna genérica e repetível embasando-se em medidas bem definidas. Dessa forma, a metodologia pode ser utilizada como um benchmark de componentes quanto ao risco e pode ser utilizada quando é preciso escolher o melhor componente para um sistema computacional, entre os vários componentes que provêem a mesma funcionalidade. Os resultados obtidos na aplicação desta abordagem em estudos de casos nos permitiram escolher o melhor componente, considerando diversos objetivos e necessidades dos usuáriosAbstract: Today's societies have become increasingly dependent on information services. A corollary is that we have also become increasingly dependent on computer software products that provide such services. The increasing tendency of software development to employ reusable components means that software dependability has become even more reliant on the dependability of integrated components. Components are usually acquired from third parties or developed by unknown development teams. In this way, the criteria employed in the testing phase of components-based systems are hardly ever been available. This lack of information, coupled with the use of components that are not specifically developed for a particular system and computational environment, makes components reutilization risky for the integrating system. Traditional studies on the risk of software components suggest that two aspects must be considered when risk assessment tests are performed, namely the probability of residual fault in software component, and the probability of such fault activation and impact on the computational system. The present work proposes the use of risk analysis to select the injection and monitoring points for fault injection campaigns. It also proposes an experimental approach to evaluate the risk a particular component may represent to a system. In order to determine the probability of a residual fault in the component, software metrics are combined in a statistical mode!. The impact of fault activation is estimated using fault injection. Through this experimental approach, risk evaluation becomes replicable and buttressed on well-defined measurements. In this way, the methodology can be used as a components' risk benchmark, and can be employed when it is necessary to choose the most suitable among several functionally-similar components for a particular computational system. The results obtained in the application of this approach to specific case studies allowed us to choose the best component in each case, without jeopardizing the diverse objectives and needs of their usersDoutoradoDoutor em Ciência da Computaçã

Reduction and Normal Forms of Matrix Pencils

Matrix pencils, or pairs of matrices, may be used in a variety of applications. In particular, a pair of matrices (E,A) may be interpreted as the differential equation E x' + A x = 0. Such an equation is invariant by changes of variables, or linear combination of the equations. This change of variables or equations is associated to a group action. The invariants corresponding to this group action are well known, namely the Kronecker indices and divisors. Similarly, for another group action corresponding to the weak equivalence, a complete set of invariants is also known, among others the strangeness. We show how to define those invariants in a directly invariant fashion, i.e. without using a basis or an extra Euclidean structure. To this end, we will define a reduction process which produces a new system out of the original one. The various invariants may then be defined from operators related to the repeated application of the reduction process. We then show the relation between the invariants and the reduced subspace dimensions, and the relation with the regular pencil condition. This is all done using invariant tools only. Making special choices of basis then allows to construct the Kronecker canonical form. In a related manner, we construct the strangeness canonical form associated to weak equivalence