Let G be a connected graph with n vertices and let x=(x1, ..., xn) be a real vector. A positive (negative) sign graph of the vector x is a maximal connected subgraph of G on vertices xi>0 (xi<0). For an eigenvalue of a generalized Laplacian of a tree: We characterize the maximal number of sign graphs of an eigenvector. We give an O(n2) time algorithm to find an eigenvector with maximum number of sign graphs and we show that finding an eigenvector with minimum number of sign graphs is an NP-complete problem. (author's abstract) / Series: Preprint Series / Department of Applied Statistics and Data Processing

The Singular Value Decomposition (SVD) has many applications in image processing. The SVD can be used to restore a corrupted image by separating significant information from the noise in the image data set. This thesis outlines broad applications that address current problems in digital image processing. In conjunction with SVD filtering, image compression using the SVD is discussed, including the process of reconstructing or estimating a rank reduced matrix representing the compressed image. Numerical plots and error measurement calculations are used to compare results of the two SVD image restoration techniques, as well as SVD image compression. The filtering methods assume that the images have been degraded by the application of a blurring function and the addition of noise. Finally, we present numerical experiments for the SVD restoration and compression to evaluate our computation.

The Kalman Filter has many applications in control and signal processing but may also be used to reconstruct a higher resolution image from a sequence of lower resolution images (or frames). If the sequence of low resolution frames is recorded by a moving camera or sensor, where the motion can be accurately modeled, then the Kalman filter may be used to update pixels within a higher resolution frame to achieve a more detailed result. This thesis outlines current methods of implementing this algorithm on a scene of interest and introduces possible improvements for the speed and efficiency of this method by use of block operations on the low resolution frames. The effects of noise on camera motion and various blur models are examined using experimental data to illustrate the differences between the methods discussed.

Thesis (Ph.D.); Submitted to Iowa State Univ., Ames, IA (US); 12 Dec 2003. / Published through the Information Bridge: DOE Scientific and Technical Information. "IS-T 2028" Haibo Cao. 12/12/2003. Report is also available in paper and microfiche from NTIS.

Made available in DSpace on 2014-06-11T19:26:56Z (GMT). No. of bitstreams: 0 Previous issue date: 2010-02-19Bitstream added on 2014-06-13T18:47:53Z : No. of bitstreams: 1 prado_ef_me_sjrp.pdf: 346611 bytes, checksum: 28c34647c269c1cbaea17d3787faa4cf (MD5) / Neste trabalho vamos estudar equações diferenciais ordinárias e analisar seu comportamento ao longo de suas trajetórias, com o principal objetivo de encontar, caso possível, uma função de Lyapunov apropriada para o sistema, isto é, dar condição suficiente e necessária para a existência dessa função. / In this work we study ordinary differential equations and analyse the behavior along of trajectories. The main goal is to find Lyapunov functions for the system when possibel: i e, we want to find necessary and sufficient conditions for the existence of those.

Orientador: Vanderlei Minori Horita / Banca: Isabel Lugão Rios / Banca: Claudio Aguinaldo Buzzi / Resumo: Neste trabalho vamos estudar equações diferenciais ordinárias e analisar seu comportamento ao longo de suas trajetórias, com o principal objetivo de encontar, caso possível, uma função de Lyapunov apropriada para o sistema, isto é, dar condição suficiente e necessária para a existência dessa função. / Abstract: In this work we study ordinary differential equations and analyse the behavior along of trajectories. The main goal is to find Lyapunov functions for the system when possibel: i e, we want to find necessary and sufficient conditions for the existence of those. / Mestre

Submitted by Luanna Matias (lua_matias@yahoo.com.br) on 2015-05-15T18:43:17Z No. of bitstreams: 2 Dissertação - Vitor Rodrigues Braga de Souza - 2014.pdf: 2674878 bytes, checksum: c37a3227405eafd0a6bcd6cdfe2ddf04 (MD5) license_rdf: 23148 bytes, checksum: 9da0b6dfac957114c6a7714714b86306 (MD5) / Approved for entry into archive by Luanna Matias (lua_matias@yahoo.com.br) on 2015-05-15T19:28:34Z (GMT) No. of bitstreams: 2 Dissertação - Vitor Rodrigues Braga de Souza - 2014.pdf: 2674878 bytes, checksum: c37a3227405eafd0a6bcd6cdfe2ddf04 (MD5) license_rdf: 23148 bytes, checksum: 9da0b6dfac957114c6a7714714b86306 (MD5) / Made available in DSpace on 2015-05-15T19:28:34Z (GMT). No. of bitstreams: 2 Dissertação - Vitor Rodrigues Braga de Souza - 2014.pdf: 2674878 bytes, checksum: c37a3227405eafd0a6bcd6cdfe2ddf04 (MD5) license_rdf: 23148 bytes, checksum: 9da0b6dfac957114c6a7714714b86306 (MD5) Previous issue date: 2014-09-26 / In the rst part of this work, we present all conical with their cartesian equations and their graphs. Then, we made an approach to concepts of linear algebra, vector spaces, linear transformations, eigenvalues and eigenvectors in order to build matrices of linear transformations able to rotate, translate or even make these conical shear. Constructed matrices, GeoGebra software for constructing graphs obtained by transformation matrices were used. Besides this geometric part, we discuss the quadratic forms in order to identify a conic analyzing only the coe cients of its quadratic form and the eigenvalues. The end result was an excellent visual material built from software GeoGebra applying the concepts of Linear Algebra. We can not fail to mention that the construction of the taper in GeoGebra techniques that replace the ruler, compass and the string used by the ancient Greeks were implemented. / Na primeira parte desse trabalho, apresentamos todas as cônicas com suas respectivas equações cartesianas e seus respectivos grá cos. Em seguida, zemos uma abordagem de conceitos de Álgebra Linear, espaços vetoriais, transformações lineares, autovalores e autovetores a m de, construir as matrizes de transformações lineares capazes de rotacionar, transladar ou até fazer o cisalhamento destas cônicas. Construídas as matrizes, foi utilizado o software GeoGebra para a construção dos grá cos obtidos pelas matrizes de transformação. Além dessa parte geométrica, abordamos as formas quadráticas no intuito de identi car uma cônica analisando apenas os coe cientes da sua forma quadrática e os autovalores associados. O resultado nal foi um excelente material visual construído a partir do software GeoGebra aplicando os conceitos de Álgebra Linear. Não podemos deixar de citar que foram implementadas técnicas de construção das cônicas no GeoGebra que substituem a régua, o compasso e o barbante utilizados pelos gregos antigos.

The purpose of this thesis is to implement algorithms of matrix eigendecomposition and pseudoinverse computation on a Field Programmable Gate Array (FPGA) platform. Firstly, there are described matrix decomposition methods that are broadly used in mentioned algorithms. Next section is focused on the basic theory and methods of computation eigenvalues and eigenvectors as well as matrix pseudoinverse. Several examples of implementation using Matlab are attached. The Vivado High-Level Synthesis tools and libraries were used for final implementation. After the brief introduction into the FPGA fundamentals the thesis continues with a description of implemented blocks. The results of each variant were compared in terms of timing and FPGA utilization. The selected block has been validated on the development board and its arithmetic precision was analyzed.

This thesis concerns methods of reduced complexity for electronic structure calculations.  When quantum chemistry methods are applied to large systems, it is important to optimally use computer resources and only store data and perform operations that contribute to the overall accuracy. At the same time, precarious approximations could jeopardize the reliability of the whole calculation.  In this thesis, the self-consistent field method is seen as a sequence of rotations of the occupied subspace. Errors coming from computational approximations are characterized as erroneous rotations of this subspace. This viewpoint is optimal in the sense that the occupied subspace uniquely defines the electron density. Errors should be measured by their impact on the overall accuracy instead of by their constituent parts. With this point of view, a mathematical framework for control of errors in Hartree-Fock/Kohn-Sham calculations is proposed.  A unifying framework is of particular importance when computational approximations are introduced to efficiently handle large systems. An important operation in Hartree-Fock/Kohn-Sham calculations is the calculation of the density matrix for a given Fock/Kohn-Sham matrix. In this thesis, density matrix purification is used to compute the density matrix with time and memory usage increasing only linearly with system size. The forward error of purification is analyzed and schemes to control the forward error are proposed. The presented purification methods are coupled with effective methods to compute interior eigenvalues of the Fock/Kohn-Sham matrix also proposed in this thesis.New methods for inverse factorizations of Hermitian positive definite matrices that can be used for congruence transformations of the Fock/Kohn-Sham and density matrices are suggested as well. Most of the methods above have been implemented in the Ergo quantum chemistry program. This program uses a hierarchic sparse matrix library, also presented in this thesis, which is parallelized for shared memory computer architectures. It is demonstrated that the Ergo program is able to perform linear scaling Hartree-Fock calculations. / QC 20100908

Dans cette thèse, nous nous intéressons à plusieurs aspects des systèmes de racines des algèbres de Lie simples. Dans un premier temps, nous étudions les coordonnées des vecteurs propres des matrices de Cartan. Nous commençons par généraliser les travaux de physiciens qui ont montré que les masses des particules dans la théorie des champs de Toda affine sont égales aux coordonnées du vecteur propre de Perron -- Frobenius de la matrice de Cartan. Puis nous adoptons une approche différente, puisque nous utilisons des résultats de la théorie des singularités pour calculer les coordonnées des vecteurs propres de certains systèmes de racines. Dans un deuxième temps, en s'inspirant des idées de Givental, nous introduisons les matrices de Cartan q-déformées et étudions leur spectre et leurs vecteurs propres. Puis, nous proposons une q-déformation des équations de Toda et construisons des 1-solitons solutions en adaptant la méthode de Hirota, d'après les travaux de Hollowood. Enfin, notre intérêt se porte sur un ensemble de transformations agissant sur l'ensemble des bases ordonnées de racines comme le groupe de tresses. En particulier, nous étudions les bases distinguées, qui forment l'une des orbites de cette action, et des matrices que nous leur associons. / In this thesis, our goal is to study various aspects of root systems of simple Lie algebras. In the first part, we study the coordinates of the eigenvectors of the Cartan matrices. We start by generalizing the work of physicists who showed that the particle masses of the affine Toda field theory are equal to the coordinates of the Perron -- Frobenius eigenvector of the Cartan matrix. Then, we adopt another approach. Namely, using the ideas coming from the singularity theory, we compute the coordinates of the eigenvectors of some root systems. In the second part, inspired by Givental's ideas, we introduce q-deformations of Cartan matrices and we study their spectrum and their eigenvectors. Then, we propose a q-deformation of Toda's equations et compute 1-solitons solutions, using the Hirota's method and Hollowood's work. Finally, our interest is focused on a set of transformations which induce an action of the braid group on the set of ordered root basis. In particular, we study an orbit for this action, the set of distinguished basis and some associated matrices.