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 “"CP-rank"”.
-
Completely Positive Matrices Over Semirings and Their CP-rank
… 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 positive matrices of order n ≥ 4 is bounded above by [n²/4]. There was some evidence in support of this conjecture. However, Bomze and his …
-
Breaking the curse of dimensionality in electronic structure methods: towards optimal utilization of the canonical polyadic decomposition
… specifically the canonical polyadic (CP) decomposition, is fairly limited. The CP decomposition is an incredibly useful sparse tensor factorization that has the ability to disentangle all correlated modes of a tensor. However the complexities associated with CP decomposition have made …
-
Algorithms and software for efficient tensor decompositions
… Python interface. The Canonical Polyadic (CP) decomposition is essential for extracting latent patterns from multi-dimensional data in fields such as signal processing, chemometrics, and machine learning. The first part of this thesis addresses accurate and well-conditioned computation of …