• Journal of the Chungcheong Mathematical Society
• /
• v.24 no.3
• /
• pp.587-593
• /
• 2011

We find concrete necessary and sufficient conditions for the existence of contractive completions of Stochastic Hankel partial contractions of size $4{\times}4$, extremal type.

• Journal of the Chungcheong Mathematical Society
• /
• v.29 no.1
• /
• pp.137-150
• /
• 2016

We introduce a new approach that allows us to solve, algorithmically, the contractive completion problem. In this article, we provide concrete necessary and sufficient conditions for the existence of contractive completions of Hankel partial contractions of size $4{\times}4$ using a Moore-Penrose inverse of a matrix.

• Journal of the Korean Mathematical Society
• /
• v.52 no.5
• /
• pp.1003-1021
• /
• 2015

A matrix completion problem has been exploited amply because of its abundant applications and the analysis of contractions enables us to have insight into structure and space of operators. In this article, we focus on a specific completion problem related to Hankel partial contractions. We provide concrete necessary and sufficient conditions for the existence of completion of Hankel partial contractions for both extremal and non-extremal types with lower dimensional matrices. Moreover, we give a negative answer for the conjecture presented in [8]. For our results, we use several tools such as the Nested Determinants Test (or Choleski's Algorithm), the Moore-Penrose inverse, the Schur product techniques, and a congruence of two positive semi-definite matrices; all these suggest an algorithmic approach to solve the contractive completion problem for general Hankel matrices of size $n{\times}n$ in both types.