Contractive symmetric matrix completion problems related to graphs

초록

In this paper, we consider the contractive real symmetric matrix completion problems motivated in part by studies on sparse (or dense) matrices for weighted sparse recovery problems and rating matrices with rating density in recommender systems. We completely characterize symmetric patterns P with the property (C) that every partially contractive real symmetric matrix with pattern P has a contractive real symmetric completion using graphs.

키워드