A polynomial-time algorithm for computing low CP-rank decompositions

网站地图 | English | 公务邮箱

About the library

Background
History
Leadership
Organization

Opening Hours
Collections
Help Via Email

Electronic Information Resources

A polynomial-time algorithm for computing low CP-rank decompositions

详细信息查看全文

作者：Khaled Elbassioni ^{kelbassioni@masdar.ac.ae" class="auth_mail" title="E-mail the corresponding author} ; Trung Thanh Nguyen ; ^{ttnguyen.cs@gmail.com" class="auth_mail" title="E-mail the corresponding author}
关键词：Completely positive matrix ; CP-rank ; CP-decomposition ; Polynomial-time algorithm ; Computational complexity
刊名：Information Processing Letters
出版年：2017
出版时间：February 2017
年：2017
卷：118
期：Complete
页码：10-14
全文大小：258 K

文摘

•: We study completely positive (cp) matrices and their cp-rank and cp-decomposition.
•: We propose an algorithm for checking if a given matrix has cp-rank of at most r.
•: The algorithm' running time is polynomial in the size of the matrix.
•: We give an algorithm for computing a cp-decomposition of a cp-matrix if it exists.

NGLC 2004-2010.National Geological Library of China All Rights Reserved.
Add:29 Xueyuan Rd,Haidian District,Beijing,PRC. Mail Add: 8324 mailbox 100083
For exchange or info please contact us via email.