𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The symmetric N-matrix completion problem

✍ Scribed by C. Mendes Araújo; Juan R. Torregrosa; Ana M. Urbano


Publisher
Elsevier Science
Year
2005
Tongue
English
Weight
261 KB
Volume
406
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

✦ Synopsis


An n × n matrix is called an N -matrix if all its principal minors are negative. In this paper, we are interested in the symmetric N -matrix completion problem, that is, when a partial symmetric N -matrix has a symmetric N -matrix completion. Here, we prove that a partial symmetric N -matrix has a symmetric N -matrix completion if the graph of its specified entries is chordal. Furthermore, if this graph is not chordal, then examples exist without symmetric N -matrix completions. Necessary and sufficient conditions for the existence of a symmetric N -matrix completion of a partial symmetric N -matrix whose associated graph is a cycle are given.


📜 SIMILAR VOLUMES


The symmetric inverse M-matrix completio
✍ Charles R. Johnson; Ronald L. Smith 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 830 KB

Necessary and sufficient conditions are given on the data for completability of a partial symmetric inverse M-matrix, the graph of whose specified entries is a cycle, and these conditions coincide with those we identify to be necessary in the general (nonsymmetric) case. Graphs for which all partial

N-matrix completion problem
✍ C.Mendes Araújo; Juan R. Torregrosa; Ana M. Urbano 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 132 KB
Matrix Completion Problems
✍ Glória Cravo 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 379 KB

Throughout the last decades, several results have been published in the area of the so-called Matrix Completion Problems. In this paper, we survey several results in this field. In particular, we describe the possible eigenvalues, the characteristic polynomial, the invariant polynomials, or the numb