Abstract

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.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call