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 96 for “"Symmetric matrices"”.
-
The identities of symmetric matrices.
Let $H\sb{n}$ denote the subspace of symmetric matrices of $M\sb{n},$ the full $n\times n$ matrix algebra with coefficients in a field F. Let $$T\sb{2n}(x\sb1,\...,x\sb{2n-1}; x\sb0)=\sum\limits\sb{\sigma\in S\sb{2n-1}\atop i\equiv 1, 2\ mod\ 4} (-1)\sp{\sigma+i-1}x\sb{\sigma(1)}\cdots …
-
Polynomial identities for skew-symmetric matrices
… (like s8) but alternating in 6 variables and symmetric in 2. We discovered that there is a space of dimension 6 for this type, and we also found a space of dimension 6 for the K4 (PI's alternating in 4 variables, symmetric in 2) and K6 (PI's alternating in 8 variables, symmetric in 2) cases. …
-
Ildl factorizations for sparse skew-symmetric matrices
Our goal is to solve a sparse skew-symmetric linear system efficiently. We propose a slight modification to the Bunch LDL\T factorization with partial pivoting strategy for skew-symmetric matrices, which saves approximately one third of the overall number of swaps of rows and columns on average. We …
-
The Characteristic Roots of Certain Real Symmetric Matrices
… study of characteristic roots of certain real symmetric matrices. Specifically, most of the matrices considered have their elements a<sub>ij </sub>= 0 except for I i - J I < 1 and are known as Jacobi matrices. The thesis fills in the details of two papers by D. E. Rutherford [12; …
-
Determining the complete spectrum for sparse symmetric matrices
… or the complete spectrum of large sparse symmetric matrices. The thesis uses a combination of theoretical analysis and experimentation with symbolic and numeric implementations to develop generally applicable, reliable, efficient and accurate algorithms that are easily applied by novice …
-
High Performance Parallel Approximate Eigensolver for Real Symmetric Matrices
… is that of computing the eigensystem of a large symmetric nonlinear eigenvalue problem. The standard approach is to use an iterative scheme involving the solution to a large symmetric linear eigenvalue problem in each iteration. In the early and intermediate iterations, significant gains in …
-
G-Varieties and the Principal Minors of Symmetric Matrices
The variety of principal minors of nxn symmetric matrices, denoted Zn, can be described naturally as a projection from the Lagrangian Grassmannian. Moreover, Zn is invariant under the action of a group G C GL(2n) isomorphic to (SL(2)xn) x Sn. One may use this symmetry to study the defining ideal of …
-
On Finding a sort of Regular Value of Positive Definite Diagonalized Symmetric Matrices
We claim that given restrictions over multiple Banach Spaces (and usually one Hilbert Space) with a common arbitrary defining variable constant, we can attain a unique numerically ordered regular value of any n-dimensional Sym∗(n, R) with dimension 1 using methods of Optimization. Through this, we …
-
Iterative Solution of Matrix Equations for Symmetric Matrices Possessing Positive and Negative Eigenvalues
Made available in DSpace on 2014-12-13T18:02:12Z (GMT). No. of bitstreams: 1 8009149.pdf: 1281854 bytes, checksum: 9f64b6dbac35e0e479827eaf188ed0c7 (MD5) Previous issue date: 1979
-
Hypergraph-Based Combinatorial Optimization of Matrix -Vector Multiplication
… matrix-vector multiplication for large sparse matrices. Parallel sparse matrix-vector multiplication is a particularly important numerical kernel in computational science. We have focused on optimizing the parallel performance of this operation by reducing the communication volume through …
-
Hypergraph-Based Combinatorial Optimization of Matrix-Vector Multiplication
… multiplication for relatively small, dense matrices that arise in finite element assembly. Previous work showed that combinatorial optimization of matrix-vector multiplication can lead to faster assembly of finite element stiffness matrices by eliminating redundant operations. Based on a …
-
Spectral graph theory of the Hypercube
… graph can be expressed in terms of certain real, symmetric matrices derived from the graph, most notably the adjacency or Laplacian matrices. Spectral Graph Theory focuses on the set of eigenvalues and eigenvectors, called the spectrum, of these matrices and provides several interesting areas of …
-
A Comparison of Methods for Seriation and Unidimensional Scaling of Asymmetric Proximity Data
… and statistics. Data in the form of asymmetric proximity matrices occur when we have observations from paired comparisons, round-robin tournaments, and networks. Skew-symmetric matrices are obtained by taking the differences between complementary pairs of objects from asymmetric …
-
Finite element solution for axisymmetric transient thermal stresses
A finite element formulation for solving axisymmetric transient heat conduction and thermal stress problems is developed in this thesis. The governing equations of uncoupled, linear, isotropic thermoelasticity are discretized using quadratic isoparametric elements. A FORTAN IV program, using double …
-
Polynomial identities of Lie subalgebras of M(n).
Let $K\sb{n}(F)$ denote the Lie algebra of skew symmetric matrices with coefficients in a field F. For 1 $\le\ k \le\ m$ + 1, define $a\sb{m}(k)(x\sb1,\cdots,x\sb{m};y)\:=\ \sum\sb{\sigma\in{\cal S}\sb{m}} (-1)\sp{\sigma}x\sb{\sigma(1)}\cdots x\sb{\sigma(k-1)}yx\sb{\sigma(k)}\cdots …
-
Principal rank characteristic sequences
… two</p> <p>sequences with an $n \times n$</p> <p>symmetric,</p> <p>complex Hermitian, or</p> <p>skew-Hermitian matrix $B$.</p> <p>The first of these is the</p> <p>principal rank characteristic sequence</p> <p>(abbreviated pr-sequence).</p> <p>This sequence is defined as</p> <p>$r_0]r_1 \cdots …
-
Numerical solution of skew-symmetric linear systems
… with iterative solvers for large and sparse skew-symmetric linear systems. First we discuss algorithms for computing incomplete factorizations as a source of preconditioners. This leads to a new Crout variant of Gaussian elimination for skew-symmetric matrices. Details on how to implement the …
-
Methods for the numerical solution of the eigenvalue problem for real symetric matrices
… solve the numerical eigenvalue problem for real symmetric matrices. On the basis of the advantages and disadvantages inherent in the various methods, it is concluded that Householder's method is the best. Since the methods of Givens, Lanczos, and Householder use the Sturm sequence bisection …
Page 1 of 5