Abstract

This paper deals with additive decompositions A = A1 + … + Ap of a given matrix A, where the ranks of the summands A1, …, Ap are prescribed and meet certain zero pattern requirements. The latter are formulated in terms of directed bipartite graphs.

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