Contractive symmetric matrix completion problems related to graphs

Authors

• Sangmin Chun, Chung-Ang University
• In Hyoun Kim, University of Incheon
• Jaewoong Kim, Korea Military Academy
• Jasang Yoon, The University of Texas Rio Grande ValleyFollow

Document Type

Article

Publication Date

7-2023

Abstract

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.

Comments

Original published version available at https://doi.org/10.1080/03081087.2022.2066615

Recommended Citation

Chun, Sangmin, In Hyoun Kim, Jaewoong Kim, and Jasang Yoon. "Contractive symmetric matrix completion problems related to graphs." Linear and Multilinear Algebra 71, no. 10 (2023): 1597-1605. https://doi.org/10.1080/03081087.2022.2066615

Publication Title

Linear and Multilinear Algebra

DOI

10.1080/03081087.2022.2066615