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 169 for “"factorizations"”.
-
Matrix Factorizations, Triadic Matrices, and Modified Cholesky Factorizations for Optimization
This thesis focuses on the Cholesky-related factorizations of symmetric matrices and their application to Newton-type optimization. A matrix is called triadic if it has at most two nonzero off-diagonal elements in each column. Tridiagonal matrices are a special case of these. We prove that the …
-
Embedding r-Factorizations of Complete Uniform Hypergraphs into s-Factorizations
The problem we study in this thesis asks under which conditions an r-factorization of Kₘʰ can be embedded into an s-factorization of Kₙʰ. This problem is a generalization of a problem posed by Peter Cameron which asks under which conditions a 1-factorization of Kₘʰ can be embedded into a …
-
Group factorizations in cryptography
Logarithmic signatures of permutation groups and their applications in private-key cryptography have been studied since the early 1980s. More recently, Magliveras, Stinson, and Trung have done some preliminary work in creating two new public-key cryptosystems, MST1, based on logarithmic signatures, …
-
N-Fold Matrix Factorizations
The study of matrix factorizations began when they were introduced by Eisenbud; they have since been an important topic in commutative algebra. Results by Eisenbud, Buchweitz, and Yoshino relate matrix factorizations to maximal Cohen-Macaulay modules over hypersurface rings. There are many …
-
On Conjectures Concerning Nonassociate Factorizations
… number of different numbers of the nonassociate factorizations of prescribed minimal length for specific finite factorization domains. The asymptotic behavior will be classified for Cohen-Kaplansky domains in Chapter 1 and for domains of the form R=K+XF[X] for finite fields K and F in Chapter 2. …
-
Products and Factorizations of Graphs
It is shown that the cardinal product of graphs does not satisfy unique prime factorization even for a very restrictive class of graphs. It is also proved that every connected graph has a decomposition as a weak cartesian product into indecomposable factors and that this decomposition is unique to …
-
Efficient VLSI architectures for matrix factorizations
… from extending the theory of Jacobi-like matrix factorizations to multi-step and inexact pivot (2 x 2) sub-matrix diagonalizations. Based on the former approach of multi-step diagonalization, and using a two-sided 2 x 2 unitary transformation amenable to CORDIC termed ${\cal Q}$ transformation, …
-
Matrix Factorizations of the Classical Discriminant
The classical discriminant D_n of degree n polynomials detects whether a given univariate polynomial f has a repeated root. It is itself a polynomial in the coefficients of f which, according to several classical results by Bézout, Sylvester, Cayley, and others, may be expressed as the determinant …
-
Embeddings and factorizations of Banach spaces
One problem, considered important in Banach space theory since at least the 1970’s, asks for intrinsic characterizations of subspaces of a Banach space with an unconditional basis. A more general question is to give necessary and sufficient conditions for operators from Lp (2 < p < 1) to factor …
-
Chern Character for Global Matrix Factorizations
… character on the DG category of global matrix factorizations on a smooth scheme $X$ with superpotential $w\in \Gamma(\O_X)$. Our formula takes values in a Cech model for Hochschild homology. Our methods may also be adapted to get an explicit formula for the Chern character for perfect complexes …
-
Tensor Products and Factorizations of Operator Systems
In this dissertation, we start by studying the operator system maximal tensor product, called max, in [17] from different perspectives. One approach is by the factorization technique used in Banach spaces [11] and operator spaces [5, 31]. Although in [14] it was used in establishing the operator …
-
Ildl factorizations for sparse skew-symmetric matrices
… solvers. Various column versions of ILUTP factorizations are investigated. We show that the approach taken saves approximately half of the work and storage compared to standard ILU factorizations that do not exploit the structure of the matrix, and the rook pivoting strategy is often …
-
Sparse and Nonnegative Factorizations For Music Understanding
… temporal information extracted by nonnegative factorizations can improve upon musical instrument recognition. Musical instrument recognition in melodic signals is difficult, especially for classification systems that rely entirely upon spectral information instead of temporal information. Here, …
-
Learning Approach for Fast Approximate Matrix Factorizations
… the orthonormal basis as well as low-rank factorizations of the tall matrix XA. While a random matrix A is the de facto choice, in this work, we improve upon its performance by utilizing a learning approach to find an adaptive projection matrix A from a set of training data. We derive a …
-
1-Factorizations of tensor products of graphs
We determine the existence of 1-factorizations of certain tensor products of graphs. The properties of these 1-factorizations are of interest; to study them, we develop results about the automorphism group of tensor products of graphs. The 1-factors of a particular product are analyzed extensively, …
-
Extending low-rank matrix factorizations for emerging applications
Low-rank matrix factorizations have become increasingly popular to project high dimensional data into latent spaces with small dimensions in order to obtain better understandings of the data and thus more accurate predictions. In particular, they have been widely applied to important applications …
-
Structured Tensor Computations: Blocking, Symmetries And Kronecker Factorizations
… and developing new computational algorithms and factorizations. In Chapter 2 we develop a novel method to embed a higher-order tensor in a larger, symmetric tensor. Such an embedding at the matrix level is well-known and has been used successfully to derive important matrix algorithms and is one …
-
Monoids, direct -sum decompositions, and elasticity of factorizations
… Not only can an element have several distinct factorizations, but even the number of factors can vary. One measures this variability by means of the elasticity function. Factorization problems arise also in representation theory. Given a finitely generated module M over a local ring R, let +(M) …
-
Geometric study of the category of matrix factorizations
We study the geometry of matrix factorizations in this dissertation. It contains two parts. The first one is a Chern-Weil style construction for the Chern character of matrix factorizations; this allows us to reproduce the Chern character in an explicit, understandable way. Some basic properties of …
Page 1 of 9