Mixed states in one spatial dimension: Decompositions and correspondence with nonnegative matrices

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Nonnegative Ranks, Decompositions, and Factorizations of Nonnegative Matrices

The nonnegative rank of a nonnegative matrix is the smallest number of nonnegative rank-one matrices into which the matrix can be decomposed additively. Such decompositions are useful in diverse scientific disciplines. We obtain characterizations and bounds and show that the nonnegative rank can be computed exactly over the reals by a finite algorithm.

متن کامل

Clustering and Metaclustering with Nonnegative Matrix Decompositions

Although very widely used in unsupervised data mining, most clustering methods are affected by the instability of the resulting clusters w.r.t. the initialization of the algorithm (as e.g. in k-means). Here we show that this problem can be elegantly and efficiently tackled by meta-clustering the clusters produced in several different runs of the algorithm, especially if “soft” clustering algori...

متن کامل

QCD with one compact spatial dimension

The realization of global symmetries can depend on the geometry of the underlying space. In particular, compactification can lead to spontaneous breaking of such symmetries. Four–dimensional QCD with fundamental representation fermions embedded in a space with one compact spatial dimension has a critical length, at which the theory undergoes a phase transition and develops a ground state that i...

متن کامل

Multirelational Consensus Clustering with Nonnegative Decompositions

Unsupervised multirelational learning (clustering) in non-sparse domains such as molecular biology is especially difficult as most clustering algorithms tend to produce distinct clusters in slightly different runs (either with different initializations or with slightly different training data). In this paper we develop a {\em multirelational consensus clustering\/} algorithm based on nonnegativ...

متن کامل

Nonnegative Matrices

For a loopless, acyclic, transitive directed graph S, we study the relations between the predecessor property and the well structured property on S. These properties assure the existence of nonnegativ€ Jordan bases for any nonnegative matrix with singular graph S.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Mathematical Physics

سال: 2020

ISSN: 0022-2488,1089-7658

DOI: 10.1063/1.5127668