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 3 of 3 for “"Completely Positive Matrices"”.
-
Completely Positive Matrices Over Semirings and Their CP-rank
An n x n real matrix A is called completely positive if it can be written as A = BB^T , where B is an n x m real nonnegative matrix for some positive integer m. The smallest such m is called the CP-rank of A. In 1994, Drew, Johnson and Loewy conjectured that the CP-rank of n x n real completely …
-
Voltooiingsprobleme vir klasse van reële simmetriese matrikse wat geslote konvekse keëls vorm
… completion problem of a few classes of symmetric matrices which form closed convex cones. The completion 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 …
-
Belief shaping in noncooperative communication and control systems through strategic signaling
… linear optimization problem over the cone of completely positive matrices when the underlying state space is finite. The ability to compute the optimal signaling strategies for large finite state spaces enables us to address the signaling problem approximately also for continuous …