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 47 for “"square matrices"”.

  1. Least-Change Secant Updates of Non-Square Matrices

    … extending most of the popular updates to the non-square case. Two applications are immediate: between-step updating of the approximate Jacobian of f(X,t) in a non-autonomous ODE system, and solving nonlinear systems of equations which depend on a parameter, such as occur in continuation methods. …

    utahstate Repository record for Least-Change Secant Updates of Non-Square Matrices (opens in a new tab)

  2. On Simultaneous Similarity of d-tuples of Commuting Square Matrices

    … when any d-tuple A of pairwise commuting N × N matrices with complex entries is cyclic, then A is simultaneously similar to the d-tuple of commuting N × N matrices B if and only if B is cyclic, and the sets of polynomials in d variables which annihilate A and B are equivalent. This thesis offers …

    usf Repository record for On Simultaneous Similarity of d-tuples of Commuting Square Matrices (opens in a new tab)

  3. Evaluating the impact of differences in the definition of overlap training on target acquisition in non-square matrices

    … in the most efficient training sequence in a non-square matrix. This study found that for one participant, the training sequence using the definition put forth in Curiel et al. (2021) resulted in 91.67 percent correct responding for all targets in the probes, and 100 percent correct responding for …

    missouri Repository record for Evaluating the impact of differences in the definition of overlap training on target acquisition in non-square matrices (opens in a new tab)

  4. Practical fast matrix multiplication algorithms

    … of computations required for multiplying n x n matrices from O(n³) to O(n [superscript 2.807]). Over the last half century, this has fueled many theoretical improvements such as other variations of Strassen-like FMM algorithms. Previous implementations of these FMM algorithms led to the "street …

    texas Repository record for Practical fast matrix multiplication algorithms (opens in a new tab)

  5. The smallest singular value of tensor matrices

    … the smallest singular value of random square matrices whose entries are independent subgaussian random variables. Statements about the behaviour of the singular values of a random matrix are expressed in stochastic terms as singular values of a random matrix are random variables …

    cau-kiel Repository record for The smallest singular value of tensor matrices (opens in a new tab)

  6. Linear transformations on algebras of matrices over the class of infinite fields

    … of linear transformations on the algebra of n-square matrices over the complex field is discussed by M. Marcus and B. N. Moyls in the paper ''Linear Transformations on Algebras of Matrices". The authors were able to characterize linear transformations which preserve one or more of the following …

    ubc Repository record for Linear transformations on algebras of matrices over the class of infinite fields (opens in a new tab) Download PDF for Linear transformations on algebras of matrices over the class of infinite fields (opens in a new tab)

  7. Εφαρμογή των αλγοριθμικών διαδικασιών στην εφαρμοσμένη θεωρία μητρών

    … and research of this thesis has to do with the square matrices, so both the transposition in matrix multiplication and the inverse matrix exist. In the introduction the group of inversible square matrices are presented with their properties. The general and specific properties of the eigenvalues …

    greece Repository record for Εφαρμογή των αλγοριθμικών διαδικασιών στην εφαρμοσμένη θεωρία μητρών (opens in a new tab)

  8. Factorization of matrices into matrices with prescribed eigenvalues

    … and sufficient conditions that a singular square complex matrix can be written as a product of two square matrices with prescribed eigenvalues are given. We will also use our results together with some old results to give new proofs or shorter proofs of some known theorems such as RadJavi's …

    uvic Repository record for Factorization of matrices into matrices with prescribed eigenvalues (opens in a new tab)

  9. What <em>Is</em> a Matrix?

    … the operations of addition and multiplication of matrices themselves, as well as scalar 'multiplication', with great stress on square matrices. Probably his work laid the foundations for the conventional matrix theory of the present. ...

    marquette Repository record for What <em>Is</em> a Matrix? (opens in a new tab)

  10. The Use of the Power Method to Find Dominant Eigenvalues of Matrices

    … the power method to find dominant eigenvalues of square matrices. It introduces ideas basic to the study and shows the development of the power method for the most well-behaved matrices possible, and it explores exactly which other types of matrices yield to the power method. The paper also …

    unt Repository record for The Use of the Power Method to Find Dominant Eigenvalues of Matrices (opens in a new tab)

  11. Interpolating Matrices

    … algebraic structure, such as a sequence of square matrices A (of eventually unbounded dimensions). First, we will consider the case in which the spectra of A lie in the unit disc, a necessary assumption if we want to apply to each matrix of the sequence a bounded holomorphic function on the …

    wustl Repository record for Interpolating Matrices (opens in a new tab)

  12. Usando a história da resolução de alguns problemas para introduzir conceitos: sistemas lineares, determinantes e matrizes.

    … solution of linear equations, determinants and matrices, besides the Laplacian development for determinants calculations of square matrices of order bigger than 3, then considering some of their general applications

    brazil-ufrn Repository record for Usando a história da resolução de alguns problemas para introduzir conceitos: sistemas lineares, determinantes e matrizes. (opens in a new tab)

  13. Applications of full rank factorization to solving matrix equations.

    In the study of matrices, we are always searching for tools which allow us to simplify our investigations. Because full rank factorizations exist for all matrices and their properties often help to simplify arguments, their uses are abundant. There exist many matrix equations for which solutions …

    baylor Repository record for Applications of full rank factorization to solving matrix equations. (opens in a new tab)

  14. Representations of McLain Groups

    … of the multiplicative group of upper triangular square matrices over a finite field with 1’s on the main diagonal. The ring R need not be finite or commutative and modules of a McLain group are allowed to be infinite dimensional over an arbitrary field F. The set , totally ordered by , is allowed …

    regina Repository record for Representations of McLain Groups (opens in a new tab) Download PDF for Representations of McLain Groups (opens in a new tab)

  15. Process Mass Spectrometric Parameterization of Butene Isomer Mixtures

    … all-mass parameterization. Empirical algorithm square matrices (each component is assigned a single ion) were compared to the square matrices that were determined by the software provided with the mass spectrometer.</p> <p>The six component hydrocarbon mixture which contained methane, ethane, …

    ut-knoxville Repository record for Process Mass Spectrometric Parameterization of Butene Isomer Mixtures (opens in a new tab)

  16. Some combinatorial properties of matrices

    … In the first problem the structure of 0-1 matrices with permanent 1, 2, or 3, is analysed. It is shown that a 0-1 matrix whose permanent is a prime number p can be brought by permutations of rows and columns into a subdirect sum of 1 -square matrices (1) and a fully indecomposable 0-1 …

    ubc Repository record for Some combinatorial properties of matrices (opens in a new tab) Download PDF for Some combinatorial properties of matrices (opens in a new tab)

  17. A MESHLESS METHOD BASED ON FIRST ORDER TAYLOR SERIES AND WEIGHTED LEAST SQUARE METHOD

    … the first order Taylor series and Weighted Least Square Method is formulated in this thesis as a variation or simplification of the original CPM. In the present method, the gradient operator is discretised into a three-dimensional array and scalar linear differential operators are discretised into …

    nus Repository record for A MESHLESS METHOD BASED ON FIRST ORDER TAYLOR SERIES AND WEIGHTED LEAST SQUARE METHOD (opens in a new tab) Download file for A MESHLESS METHOD BASED ON FIRST ORDER TAYLOR SERIES AND WEIGHTED LEAST SQUARE METHOD (opens in a new tab)

  18. Constraint Solving for User Interface Layout Problems

    … particularly efficient for problems with sparse matrices, as they appear in GUI layout specifications. However, SOR as described in the literature has its limitations: it works only with square matrices and does not support soft constraints, which makes it inapplicable to UI layout problems. This …

    auckland-ms Repository record for Constraint Solving for User Interface Layout Problems (opens in a new tab)

Page 1 of 3