On nonnegative factorization of matrices. (English) Zbl 0626.15010

Kaykobad, M.

Linear Algebra Appl. 96, 27-33 (1987).

The author utilizes techniques from graph theory to show that if A is an \(n\times n\) nonnegative diagonally dominant symmetric matrix, then there is an \(n\times m\) nonnegative matrix B such that \(A=BB^ t\). Under these conditions he produces an algorithm to compute B.

Reviewer: G.P.Barker

MSC:

15B48	Positive matrices and their generalizations; cones of matrices
15A23	Factorization of matrices
65F05	Direct numerical methods for linear systems and matrix inversion

Keywords:

completely positive; vertex-edge incidence matrix; nonnegative diagonally dominant symmetric matrix; algorithm

References:

[1]	Diananda, P. H., On non-negative forms in real variables some or all of which are nonnegative, Proc. Cambridge Philos. Soc., 58, 17-25 (1962) · Zbl 0108.04803
[2]	Gray, L. J.; Wilson, D. G., Non-negative factorization of semidefinite non-negative matrices, Linear Algebra Appl., 31, 119-127 (1980) · Zbl 0434.15012
[3]	Hall, M.; Newman, M., Copositive and completely positive quadratic forms, Proc. Cambridge Philos. Soc., 59, 329-339 (1963) · Zbl 0124.25302
[4]	Hannah, J.; Laffey, T. L., Nonnegative factorization of completely positive matrices, Linear Algebra Appl., 55, 1-9 (1983) · Zbl 0519.15007
[5]	Harary, F., Graph Theory (1972), Addison-Wesley · Zbl 0797.05064
[6]	Lau, C. M.; Markham, T. L., Square triangular factorizations of completely positive matrices, J. Industrial Math. Soc., 28, 15-24 (1978) · Zbl 0398.15011
[7]	Markham, T. L., Factorization of completely positive matrices, Proc. Cambridge Philos. Soc., 69, 53-58 (1971) · Zbl 0205.33004
[8]	Samuel, P., Algebraic Theory of Numbers (1970), Hermann: Hermann Paris · Zbl 0215.36001