𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The N-matrix completion problem under digraphs assumptions

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

Publisher
Elsevier Science
Year
2004
Tongue
English
Weight
209 KB
Volume
380
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

N-matrix completion problem
N-matrix completion problem
✍ C.Mendes Araújo; Juan R. Torregrosa; Ana M. Urbano 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 132 KB
The symmetric N-matrix completion proble
The symmetric N-matrix completion problem
✍ C. Mendes Araújo; Juan R. Torregrosa; Ana M. Urbano 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 261 KB

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 s

The symmetric inverse M-matrix completio
The symmetric inverse M-matrix completion problem
✍ 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