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 12 of 12 for “"Non-negative matrices"”.

  1. Positive Controllability of Systems with Nearly-Non-Negative Matrices

    … theorem on controllability. Properties of nearly-non-negative matrices are discussed and in particular a theorem on the behavior of the exponential matrix of nearly-non-negative matrices is proven. These results are then used to prove that the reachable set for systems with nearly-non-negative …

    utahstate Repository record for Positive Controllability of Systems with Nearly-Non-Negative Matrices (opens in a new tab)

  2. Stability and Spectral Properties in the Max Algebra with Applications in Ranking Schemes

    … the correspondence between the max algebra and non-negative linear algebra. It is motivated by the Perron-Frobenius theory as a powerful tool in ranking applications. Throughout the thesis, we consider max-algebraic versions of some standard results of non-negative linear algeb- ra. We are …

    maynooth Download PDF for Stability and Spectral Properties in the Max Algebra with Applications in Ranking Schemes (opens in a new tab)

  3. Identifying the largest component of the dominant eigenvector of a matrix

    … to compute the dominant eigenvector of non-negative matrices which obtain the dominant eigenvalue as well are developed. Convergence of one of these allgorithrms is proved. An example is provided which illustrates many of the theorems, and the algorithms are worked through on this …

    eastern-wash Repository record for Identifying the largest component of the dominant eigenvector of a matrix (opens in a new tab)

  4. ADMM for SDP Relaxation of GP

    … method is that optimizing over the set of doubly non-negative matrices is about as difficult as optimizing over the set of positive semidefinite matrices. Enforcing the non-negativity constraint gives us a clear improvement in the quality of bounds obtained. We implement both a high rank and a …

    waterloo Repository record for ADMM for SDP Relaxation of GP (opens in a new tab)

  5. Characterization of Rate Region and User Removal in Interference Channels with Constrained Power

    … based on the Perron-Frobenius eigenvalue of some non-negative matrices. While the boundary of the rate region for the case of unconstrained power is a well-established result, this is the first result for the case of constrained power. This result is utilized to develop an efficient user removal …

    waterloo Repository record for Characterization of Rate Region and User Removal in Interference Channels with Constrained Power (opens in a new tab)

  6. Efficient alternating gradient-type algorithms for the approximate non-negative matrix factorization problem

    The approximate non-negative matrix factorization problem (ANMF) seeks to interpret a given set of non-negative data vectors, where the non-negativity is physically meaningful, through the extraction of a sufficiently small set of non-negative "features". Each data vector is then approximated by a …

    rice Repository record for Efficient alternating gradient-type algorithms for the approximate non-negative matrix factorization problem (opens in a new tab)

  7. A Review of Some Important Conclusions about the Paving Conjecture

    … to the Paving Conjecture for the triangular matrices, and the result that self-adjoint matrices with all entries non-negative are pavable.

    south-carolina Repository record for A Review of Some Important Conclusions about the Paving Conjecture (opens in a new tab)

  8. Robust Learning, Inference and Uncertainty Quantification via Contrast

    … be used to uniquely recover $S$, a new result on non-negative matrices which could be of independent interest. With a method to estimate $S$ established, we demonstrate how this estimate of $S$, in conjunction with the contrastive model, can be used to estimate the posterior class portability …

    arizona-thes Repository record for Robust Learning, Inference and Uncertainty Quantification via Contrast (opens in a new tab)

  9. On the nonnegative least squares

    In this document, we study the nonnegative least squares primal-dual method for solving linear programming problems. In particular, we investigate connections between this primal-dual method and the classical Hungarian method for the assignment problem. Firstly, we devise a fast procedure for …

    gatech Repository record for On the nonnegative least squares (opens in a new tab)

  10. Study of non-negative matrix factorizations: foundations, methods, algorithms, and applications, A

    … most popular one, which is simple yet efficient. Non-negative matrix factorization (\textbf{NMF}) is a classical mathematical problem which aims to give two non-negative matrices $F$ and $G$ so that $FG$ approximate the given nonnegative matrix $X$. Due to its elegant formulation, \textbf{NMF} has …

    colo-mines Repository record for Study of non-negative matrix factorizations: foundations, methods, algorithms, and applications, A (opens in a new tab)

  11. Extensions of Perron-Frobenius Theory

    … Oscar Perron in 1907 with a result on positive matrices and Georg Frobenius in 1912, who extended that result to the case of irreducible nonnegative matrices. An Mv-matrix is a matrix of the form A=sI−B, where 0≤ρ(B)≤s and B is an eventually nonnegative matrix. A GM-matrix denotes a matrix of …

    greece Repository record for Extensions of Perron-Frobenius Theory (opens in a new tab)