We study square matrices which are products of simpler factors with the property that any ordering of the factors yields a matrix cospectral with the given matrix. The results generalize those obtained previously by the authors.

A symmetric positive semi-definite matrix $A$ is called completely positive if there exists a matrix $B$ with nonnegative entries such that $A=B{B}^{\top }$. If $B$ is such a matrix with a minimal number $p$ of columns, then $p$ is called the cp-rank of $A$. In this paper we develop a finite and exact algorithm to factorize any matrix $A$ of cp-rank $3$. Failure of this algorithm implies that $A$ does not have cp-rank $3$. Our motivation stems from the question if there exist three nonnegative polynomials of degree at most four that...