Submitted by Automa??o e Estat?stica (sst@bczm.ufrn.br) on 2016-07-25T23:16:56Z No. of bitstreams: 1 MarciaGabrieleGoncalvesDeSousaLima_DISSERT.pdf: 503985 bytes, checksum: 91a629d4653d03d67f3bd647b545c778 (MD5) / Approved for entry into archive by Arlan Eloi Leite Silva (eloihistoriador@yahoo.com.br) on 2016-08-04T21:49:11Z (GMT) No. of bitstreams: 1 MarciaGabrieleGoncalvesDeSousaLima_DISSERT.pdf: 503985 bytes, checksum: 91a629d4653d03d67f3bd647b545c778 (MD5) / Made available in DSpace on 2016-08-04T21:49:11Z (GMT). No. of bitstreams: 1 MarciaGabrieleGoncalvesDeSousaLima_DISSERT.pdf: 503985 bytes, checksum: 91a629d4653d03d67f3bd647b545c778 (MD5) Previous issue date: 2015-10-29 / Esse trabalho de pesquisa tem por objetivo, fazer um estudo sobre a teoria alg?brica dos polin?mios matriciais m?nicos, bem como das defini??es, conceitos e propriedades de no que diz respeito a bloco autovalores, bloco autovetores e solventes de P(X). Investigando as principais rela??es entre o polin?mio matricial e as matrizes bloco. Companheira e bloco Vandermonde. Estudamos a constru??o de polin?mios matriciais com determinados solventes e a extens?on da M?todo da Pot?ncia , para calcular blocos autovalores da matriz Companheira e solventes de P(X). Atrav?s da rela??o entre o bloco autovalor dominante da matriz Companheira e o solvente dominante de P(X) ? poss?vel obtermos a converg?ncia do algoritmo para o solvente dominante do polin?mio matricial m?nico. Ilustramos com exemplos num?ricos para casos distintos de converg?ncia. / This research work aims to make a study of the algebraic theory of matrix monic polynomials, as well as the definitions, concepts and properties with respect to block eigenvalues, block eigenvectors and solvents of P(X). We investigte the main relations between the matrix polynomial and the Companion and Vandermonde matrices. We study the construction of matrix polynomials with certain solvents and the extention of the Power Method, to calculate block eigenvalues and solvents of P(X). Through the relationship between the dominant block eigenvalue of the Companion matrix and the dominant solvent of P(X) it is possible to obtain the convergence of the algorithm for the dominant solvent of the matrix polynomial. We illustrate with numerical examples for diferent cases of convergence.

Made available in DSpace on 2014-12-17T15:26:38Z (GMT). No. of bitstreams: 1 ThiagoJA_DISSERT.pdf: 636679 bytes, checksum: 3497bfd29c2779ff70f7932b9a308a9c (MD5) Previous issue date: 2012-08-13 / Coordena??o de Aperfei?oamento de Pessoal de N?vel Superior / In this work we have elaborated a spline-based method of solution of inicial value problems involving ordinary differential equations, with emphasis on linear equations. The method can be seen as an alternative for the traditional solvers such as Runge-Kutta, and avoids root calculations in the linear time invariant case. The method is then applied on a central problem of control theory, namely, the step response problem for linear EDOs with possibly varying coefficients, where root calculations do not apply. We have implemented an efficient algorithm which uses exclusively matrix-vector operations. The working interval (till the settling time) was determined through a calculation of the least stable mode using a modified power method. Several variants of the method have been compared by simulation. For general linear problems with fine grid, the proposed method compares favorably with the Euler method. In the time invariant case, where the alternative is root calculation, we have indications that the proposed method is competitive for equations of sifficiently high order. / Neste trabalho desenlvolvemos um m?todo de resolu??o de problemas de valor inicial com equa??es diferenciais ordin?rias baseado em splines, com ?nfase em equa??es lineares. O m?todo serve como alternativa para os m?todos tradicionais como Runge-Kutta e no caso linear com coeficientes constantes, evita o c?lculo de ra?zes de polin?mios. O m?todo foi aplicado para um problema central da teoria de controle, o problema de resposta a degrau para uma EDO linear, incluindo o caso de coeficientes n?o-constantes, onde a alternativa pelo c?lculo de ra?zes n?o existe. Implementamos um algoritmo eficiente que usa apenas opera??es tipo matriz-vetor. O intervalo de trabalho (at? o tempo de acomoda??o) para as equa??es est?veis com coeficientes constantes ?e determinado pelo c?lculo da raiz menos est?vel do sistema, a partir de uma adapta??o do m?todo da pot?ncia. Atrav?s de simula??es, comparamos algumas variantes do m?todo. Em problemas lineares gerais com malha suficientemente fina, o novo m?todo mostra melhores resultados em compara??o com o m?todo de Euler. No caso de coeficientes constantes, onde existe a alternativa baseada em c?lculo das ra?zes, temos indica??es que o novo m?todo pode ficar competitivo para equa??es de grau bastante alto