A constrained matrix factorization problem
If S is a subset of ordered pairs (i,j) of integers with 1\(\leq i,j\leq n\), then an \(n\times n\) matrix W is S-constrained if \(w_{ij}=0\) for (i,j)\(\not\in S\). The main theorem asserts the existence of S-constrained factorizations and gives a formula for one such. However, the result involves the left inverse of a square matrix without explaining the sense in which the term left inverse is meant. Neither the example nor the proof clarified the matter. The proof seems to assume that the left inverse always exists. In the statement of the result superscripts on a matrix P indicate an indexing rather than an exponent. The paper closes with an application to digital image processing.
This page was built for publication: A constrained matrix factorization problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q797658)
