Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 6 of 6 for “"Cayley-Hamilton Theorem"”.

  1. Extensions of the Cayley-Hamilton Theorem with Applications to Elliptic Operators and Frames.

    The Cayley-Hamilton Theorem is an important result in the study of linear transformations over finite dimensional vector spaces. In this thesis, we show that the Cayley-Hamilton Theorem can be extended to self-adjoint trace-class operators and to closed self-adjoint operators with trace-class …

    etsu Repository record for Extensions of the Cayley-Hamilton Theorem with Applications to Elliptic Operators and Frames. (opens in a new tab) Download PDF for Extensions of the Cayley-Hamilton Theorem with Applications to Elliptic Operators and Frames. (opens in a new tab)

  2. The Classical Lie algebras are more simple than they may appear

    … linear algebra proving the Primary decomposition theorem and the Cayley-Hamilton Theorem. Following this, we dive into the world of Lie algebras where we look at Lie algebras of dimensions 1, 2 and 3, representations of Lie algebras, weight spaces, Cartan's criteria and the root space …

    cape-town Repository record for The Classical Lie algebras are more simple than they may appear (opens in a new tab)

  3. Incorporating Acoustical Consistency in the Design for Manufacturing of Wooden Guitars

    … matrices, a new method based on the generalized Cayley-Hamilton theorem was proposed in the thesis. A further method, based on the determinant of the generalized eigenvalue problem was also presented. Both methods work well, although the determinant method is shown to be more efficient for …

    ottawa-retro Repository record for Incorporating Acoustical Consistency in the Design for Manufacturing of Wooden Guitars (opens in a new tab)

  4. Distributed Computation of Graph Spectrum, Eigenvector Centrality, and Solution to Linear Equations

    … uses a discrete-time linear iteration and the Cayley-Hamilton theorem to convert the problem into one of solving linear equations, where each equation is known to a node. In the second stage, if the nodes happen to know that said matrix is cyclic, the algorithm uses a Lyapunov approach to …

    oklahoma-thes Repository record for Distributed Computation of Graph Spectrum, Eigenvector Centrality, and Solution to Linear Equations (opens in a new tab)

  5. Slabě zpožděné systémy lineárních diskrétních rovnic v R^3

    Dizertační práce se zabývá konstrukcí obecného řešení slabě zpožděných systémů lineárních diskrétních rovnic v ${\mathbb R}^3$ tvaru \begin{equation*} x(k+1)=Ax(k)+Bx(k-m), \end{equation*} kde $m>0$ je kladné celé číslo, $x\colon \bZ_{-m}^{\infty}\to\bR^3$, $\bZ_{-m}^{\infty} := \{-m, -m+1, \dots, …

    brno-tech Repository record for Slabě zpožděné systémy lineárních diskrétních rovnic v R^3 (opens in a new tab)

  6. Algebraic subjects / theory of matrices : and applications

    … of their component parts. The multiplication theorem for compounds and adjugates of Binet and Cauchy is proved, and its application is fundamental throughout. One of the results is that if matrices <em>a</em>, <em>b</em> are square of order m, n and <em>x</em>, <em>y</em> are of order mxn, nxm …

    oxford Repository record for Algebraic subjects / theory of matrices : and applications (opens in a new tab)