✦ LIBER ✦

The copositive completion problem

✍ Scribed by Leslie Hogben; Charles R. Johnson; Robert Reams

Publisher: Elsevier Science
Year: 2005
Tongue: English
Weight: 163 KB
Volume: 408
Category: Article
ISSN: 0024-3795
DOI: 10.1016/j.laa.2005.06.019

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The copositive completion problem: Unspe

The copositive completion problem: Unspecified diagonal entries

✍ Leslie Hogben 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 88 KB

The elliptic matrix completion problem

✍ Ossama A. Saleh; Ronald L. Smith 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 191 KB

N-matrix completion problem

✍ C.Mendes Araújo; Juan R. Torregrosa; Ana M. Urbano 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 132 KB

On the optional hamiltonian completion p

On the optional hamiltonian completion problem

✍ P. J. Slater; S. E. Goodman; S. T. Hedetniemi 📂 Article 📅 1976 🏛 John Wiley and Sons 🌐 English ⚖ 742 KB

The positive definite completion problem

The positive definite completion problem revisited

✍ Ronald L. Smith 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 134 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