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 80 for “"positive semidefinite"”.
-
Positive semidefinite propagation time
<p>Let G be a simple, undirected graph. Positive semidefinite (PSD) zero forcing on G is based on the following color-change rule: Let W<sub>1</sub>,W<sub>2</sub>, ..., W<sub>k</sub> be the sets of vertices of the k connected components in G - B (where B is a set of blue vertices). If w is in …
-
Positive semidefinite maximum nullity and zero forcing number
… by a simple, undirected graph. We study the positive semidefinite zero forcing number and some of its properties. In addition, we compute the positive semidefinite maximum nullity and zero forcing number for a variety of graph families. We establish the field independence of the hypercube, by …
-
The Positive Semidefinite Rank of Matrices and Polytopes
The positive semidefinite (psd) rank of a nonnegative <italic>p</italic> × <italic>q</italic> matrix <italic>M</italic> is defined to be the smallest integer <italic>k</italic> such that there exist <italic>k</italic> × <italic>k</italic> psd matrices <italic>A</italic><sub>1</sub>,…, …
-
Protein Structure Elastic Network Models and the Rank 3 Positive Semidefinite Matrix Manifold
… in the Hookean potential which leads to a positive semidefinite (PSD) potential that is a function of quadrances rather than distances. There are many similarities between the two approaches, but also many differences. One main difference is PSD matrices are linearly related to quadrance, …
-
A fractional approach to minimum rank and zero forcing
… Using similar techniques, fractional minimum positive semidefinite rank is defined via $r$-fold generalizations of faithful orthogonal representations and $r$-fold minimum positive semidefinite rank, and it is shown that the fractional minimum positive semidefinite rank of any graph equals the …
-
Properties of positive definite matrices and applications
… this paper is to investigate the properties of positive definite matrices, and in some cases positive semidefinite matrices, and their applications.</p> <p>Chapter 1 introduces some general properties of positive definite matrices. Chapter 2 investigates how positive definite and positive …
-
Non-chordal patterns associated with the positive definite completion problem
… this completion admits a specific structure. The positive definite completion problem asks whether a partial Hermitian matrix admits a completion such that the completed matrix is positive semidefinite. The minimum solution criterion, is that every fully specified principal submatrix is …
-
Voltooiingsprobleme vir klasse van reële simmetriese matrikse wat geslote konvekse keëls vorm
… problem of the SPN matrix, which is the sum of a positive semidefinite matrix and a nonnegative matrix, forms the main focus of this study. The completion problems of positive semidefinite matrices, completely positive matrices and SPN matrices are directly related to a certain graph that …
-
Low-Rank Plus Sparse Decompositions of Large-Scale Matrices via Semidefinite Optimization
… matrix into the sum of a low-rank symmetric positive semidefinite matrix and a tridiagonal matrix, and a relaxation which looks for symmetric positive semidefinite matrices with small nuclear norms. These problems are generalizations of the problem of decomposing a symmetric matrix into a …
-
On a graph parameter related to vertex labelings and its application to minimum rank problems in graph theory
This thesis regards the minimum rank and minimum positive semidefinite rank of a simple graph. A graph parameter, called the minimum labeling degree (mld), is defined in terms of the concept of a vertex labeling of a graph, and its value is calculated for a few graph classes. It is proved here that …
-
Structured eigenvectors, interlacing, and matrix completions
… completion results that we present include: the positive semidefinite cycle completion problem for matrices with data from the complex numbers, distance matrix cycle completability conditions, the P-matrix completion problem, and the totally non-negative completion problem. We show that the …
-
Propagation processes on graphs and applications
… an upper bound for the maximum nullity of a positive semidefinite graph, which is the maximum nullity over all symmetric positive semidefinite matrices whose non-zero off-diagonal entries correspond to the edges of the graph. Product throttling for positive semidefinite zero forcing answers …
-
Factorization of matrices into matrices with prescribed eigenvalues
… matrices and Wu's theorem about products of four positive semidefinite matrices.
-
Connections to zero forcing: Tree covers and power domination
… let $\mathcal{S}_+(G)$ denote the set of real positive semidefinite matrices $A=(a_{ij})$ such that $a_{ij}\neq 0$ if $\{i,j\}\in E$, $a_{ij}=0$ if $\{i,j\}\notin E$, and $a_{ii}$ is any real number. The maximum positive semidefinite nullity of $G$, denoted $\Mp(G),$ is $\max\{\nullity(A)|A\in …
-
Low rank representations of matrices using nuclear norm heuristics
… is shown that the nuclear norm of the associated positive semidefinite matrix can be evaluated in terms of the second elementary symmetric polynomial evaluated at the partition. We prove that for k-partite graphs the maximum value of the nuclear norm of the associated positive semidefinite matrix …
-
Inner approximation of convex cones via primal-dual ellipsoidal norms
… second order cones and the cones of symmetric positive semidefinite matrices. Then we move to the more challenging problem of finding a largest pair (in the sense of geometric mean of their radii) of primal-dual ellipsoids (in the sense of dual norms) with specified centers that are contained …
-
Kernels: Regularization and Optimization
… There have been many successful applications of positive semidefinite kernels in diverse fields. Among the reasons for its success are a theoretically motivated regularization method and efficient algorithms for optimizing the resulting problems. Since the kernel has to effectively capture the …
-
Constrained signal reconstruction
… problem of this type is the extrapolation of a positive semidefinite sequence, which is equivalent to the covariance extension and trigonometric moment problems. Classical results are extended to incorporate the additional convex constraints imposed by spectral support limits and bounding …
-
On the numerical solution of continuous coupled algebraic Riccati equations
… accelerated Riccati iteration which computes a positive semidefinite solution of the continuous coupled algebraic Riccati equation. In particular, we establish sufficient conditions for the convergence of this algorithm. We also prove that for particular initial values this algorithm determines …
-
Adversarial Two-Party Quantum Interactions in Cryptography and Machine Learning
… bound for learning over general subsets of positive semidefinite matrices via the regularized follow-the-leader algorithm and apply it to various settings involving the learning of quantum objects. For concrete applications, we present a sublinear regret bound for learning quantum states, …
Page 1 of 4