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 20 of 25 for “"2)-matrices"”.

  1. A study of certain modular representations

    … of p elements, M the semigroup of all 2 x 2 matrices over F , G the group GL(2, p) of invertible elements of M , and S the normal subgroup SL(2, p) of G consisting of the matrices of determinant one. The aim of this thesis is to study the representations of M, G and S over F.

    anu Repository record for A study of certain modular representations (opens in a new tab)

  2. Two problems in iterative nonlinear maps

    … of a logistic map defined in real 2 x 2 matrices. We show how these boundaries are of a mixed type, combining fractal and smooth regions. We find in these boundaries a very complex distribution of transient scaling behaviors that can mask in some regions the fractal nature of the set. We …

    uiuc Repository record for Two problems in iterative nonlinear maps (opens in a new tab)

  3. Implementation Analysis of Strassen-Like Matrix Multiplication Algorithms Based on Block Decomposition

    … of the naive method for multiplying two n×n matrices requires O(n^3) arithmetic operations over the ring in which the matrix entries lie. In 1969, Strassen proposed the first sub-cubic complexity algorithm for matrix multiplication. Strassen's algorithm (SA) multiplies two 2×2 matrices using …

    waterloo Repository record for Implementation Analysis of Strassen-Like Matrix Multiplication Algorithms Based on Block Decomposition (opens in a new tab)

  4. Traces of matrix products.

    … equivalent classes for a matrix string of 2× 2 matrices which is comprised of two different matrices A and B with k A's and n − k B's is derived. Simulations for traces of matrix products with 2 A's and n B's for n varying from 2 to10are carried out. A comparison between traces of ABAB and AABB …

    umn Repository record for Traces of matrix products. (opens in a new tab)

  5. Knot Groups and Their Homomorphisms into SU(2)

    … to algebraic topology, knot theory, and SU(2) matrices as a subset of the quaternions, then proceed to introduce a technique of finding homomorphisms of knot complement fundamental groups into SU(2) and illustrate it by finding homomorphisms for the fundamental groups of the complement of the …

    unr Repository record for Knot Groups and Their Homomorphisms into SU(2) (opens in a new tab)

  6. Exploring the Numerical Range of Block Toeplitz Operators

    … of the numerical range for any \(2 \times 2\) matrices \(A_0\) and \(A_1\). We finish by providing examples of flat portions on the boundary of the numerical range when \(A_0, A_1 \in M_n(\mathbb{C})\), for \(3 \leq n \leq 5\).

    calpoly Repository record for Exploring the Numerical Range of Block Toeplitz Operators (opens in a new tab)

  7. Probability on graphs: A comparison of sampling via random walks and a result for the reconstruction problem

    … problem for general trees and general 2 × 2 matrices in terms of the branching number of the tree and some function of the matrix. Specifically, if the transition probabilities between the two states in the state space are a and b , we show that we do not have reconstruction if Br( T ) …

    oregon Repository record for Probability on graphs: A comparison of sampling via random walks and a result for the reconstruction problem (opens in a new tab)

  8. On the representation theory of GL(2,F_{q}).

    … denote the group of invertible $2\times 2$ matrices over the finite field $\mathbb{F}_q$, where $q$ is the power of a prime number. This thesis investigates the complex irreducible representations of $G$. Chapter 2 gives an overview of the general theory of finite-dimensional representations …

    manitoba Repository record for On the representation theory of GL(2,F_{q}). (opens in a new tab)

  9. ON THE LYAPUNOV-TYPE DIAGONAL STABILITY

    … to common diagonal Lyapunov solutions on two matrices of order one less. An enhanced statement of this result based on the Schur complement formulation is presented here along with a shorter and purely matrix-theoretic proof. We develop a number of extensions to this result, and formulate the …

    siu-theses Repository record for ON THE LYAPUNOV-TYPE DIAGONAL STABILITY (opens in a new tab)

  10. The proxy point method for rank-structured matrices

    … to reduce computation and storage cost for dense matrices defined by interactions between many bodies. The main bottleneck for their application is the expensive computation required to represent a matrix in a rank-structured matrix format which involves compressing specific matrix blocks into …

    gatech Repository record for The proxy point method for rank-structured matrices (opens in a new tab)

  11. An investigation of two semi-linear problems of optimum control

    … a 2 x 1 matrix, and where A,B,C, and D are 2 x 2 matrices of functions of t. t(1) is a variable, hence the differential equation is non-linear. Problems associated with this differential equation are called semi-linear. In the first problem, a condition is found on t1 and F which must be satisfied …

    nps Repository record for An investigation of two semi-linear problems of optimum control (opens in a new tab)

  12. Construction of Unitary Matrices and Bounding Minimal Quantum Gate Fidelity Using Genetic Algorithms

    … consists of a number of $2 \times 2$ matrices being evolved and combined such that a unitary matrix capable of carrying out a predetermined function on a pure quantum state is generated. In this thesis the algorithm will demonstrate proficiency at performing tasks such as cloning a …

    guelph Repository record for Construction of Unitary Matrices and Bounding Minimal Quantum Gate Fidelity Using Genetic Algorithms (opens in a new tab)

  13. Asymptotic formulae for certain arithmetic functions produced by fractional linear transformations

    … arising from certain $2 \times 2$ matrices, establish asymptotic formulae for averages of these functions, and explore certain maps that arise from considering the leading terms of these averages. We further generalize to a larger class of maps by introducing real moments, which …

    uiuc Repository record for Asymptotic formulae for certain arithmetic functions produced by fractional linear transformations (opens in a new tab)

  14. On quantum commutation relations for the coordinate algebras of coefficients of binary forms

    … the induced linear transformation for all 2 x 2 matrices.</p> <p>In the classical theory all elements commute. In this thesis a nonclassical or quantum invariant theory of binary forms will be considered in which elements do not commute. Two types of quantization will be introduced. Each …

    ut-knoxville Repository record for On quantum commutation relations for the coordinate algebras of coefficients of binary forms (opens in a new tab)

  15. On the Diagonals of Projections in Matrix Algebras Over Von Neumann Algebras

    … case of M_2(M_n(C)), the full algebra of 2 x 2 matrices over M_n(C). The example gives us hints regarding the possibility of extracting an underlying notion of convexity for C*-polytopes, which are not necessarily convex.

    penn Repository record for On the Diagonals of Projections in Matrix Algebras Over Von Neumann Algebras (opens in a new tab)

  16. Classical and Computational Algebraic Geometry in Computer Vision

    … y_i^\top)$ and producing the rank $2$ matrices in its nullspace. Each choice of rank $2$ matrix determines a possible arrangement of cameras, unique up to change of coordinates in $\PP^3$. Generically, there will be exactly three rank $2$ matrices in this nullspace, but this will not …

    washington Repository record for Classical and Computational Algebraic Geometry in Computer Vision (opens in a new tab)

  17. Representing modular tensor categories: a computer algebra system for topological quantum computing

    … basic linear algebra operations to handle matrices of zero-dimension and 2-matrices (matrices of matrices). Then, representations for the 0-cells, 1-cells, and 2-cells of 2Vect are found. Due to the chosen representation, various structural isomorphisms are required to ensure equations …

    oxford Repository record for Representing modular tensor categories: a computer algebra system for topological quantum computing (opens in a new tab)

  18. Mappings on triangular algebras

    … elements can be written in the form of 2 x 2 matrices [special characters omitted]where a ∈ A, b ∈ B, m ∈ M and where A, B are algebras and M is a bimodule. Many widely studied algebras, such as upper triangular matrix algebras and nest algebras, can be viewed as triangular algebras. This …

    uvic Repository record for Mappings on triangular algebras (opens in a new tab)

  19. Biomaterial-Stem Cell Approaches to Augment Regeneration

    … This thesis uses ECM-mimicking, collagen-based matrices to improve the regenerative response. Specifically, such a matrix is demonstrated to improve the potency of ex vivo expanded circulating angiogenic cells for treatment of ischemic muscle (Chapter 2). Matrices were also functionalized to …

    ottawa-retro Repository record for Biomaterial-Stem Cell Approaches to Augment Regeneration (opens in a new tab)

  20. ORDERED MATRICES OF PRESCRIBED ROW AND COLUMN SUM

    Let M(n,s) be the number of nxn matrices with binary entries, row and column sum s, and whose rows are in lexicographical order. Let S(n) be the number of nxn matrices with entries from {0,1,2}, symmetric, with trace 0, and row sum 2. (The sequence S(n) appears as A002137 in N.J.A. Sloane's Online …

    clemson Repository record for ORDERED MATRICES OF PRESCRIBED ROW AND COLUMN SUM (opens in a new tab)

Page 1 of 2