Matrix Completion and Decomposition in Phase Bounded Cones
Preprint, 2024

The problem of matrix completion and decomposition in the cone of positive semidefinite (PSD) matrices is a well-understood problem, with many important applications in areas such as linear algebra, optimization, and control theory. This paper considers the completion and decomposition problems in a broader class of cones, namely phase-bounded cones. We show that most of the main results from the PSD case carry over to the phase-bounded case. More precisely, this is done by first unveiling a duality between the completion and decomposition problems, using a dual cone interpretation. Based on this, we then derive necessary and sufficient conditions for the phase-bounded completion and decomposition problems, and also characterize all phase-bounded completions of a completable partial matrix with a banded pattern.

completion

decomposition

chordal graph

phases

numerical range

Author

Ding Zhang

Hong Kong University of Science and Technology

Axel Ringh

Chalmers, Mathematical Sciences, Applied Mathematics and Statistics

Li Qiu

The Chinese University of Hong Kong, Shenzhen

Subject Categories

Computational Mathematics

Other Mathematics

Control Engineering

Roots

Basic sciences

DOI

10.48550/arXiv.2409.10282

More information

Latest update

12/11/2024