𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A polynomial-time test for M-matrices

✍ Scribed by H. Väliaho

Publisher
Elsevier Science
Year
1991
Tongue
English
Weight
508 KB
Volume
153
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Probabilistic Algorithm to Test Local
A Probabilistic Algorithm to Test Local Algebraic Observability in Polynomial Time
✍ Alexandre Sedoglavic 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 395 KB

The following questions are often encountered in system and control theory. Given an algebraic model of a physical process, which variables can be, in theory, deduced from the input-output behaviour of an experiment? How many of the remaining variables should we assume to be known in order to determ

A Central Polynomial of Low Degree for 4
A Central Polynomial of Low Degree for 4×4 Matrices
✍ V. Drensky; G.M.P. Cattaneo 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 356 KB

We have found a central polynomial of degree 13 for the \(4 \times 4\) matrix algebra over a field of characteristic 0 . This result agrees with the conjecture that the minimal degree of such polynomials for \(n \times n\) matrices is \(\left(n^{2}+3 n-2\right) / 2\). The polynomial has been obtaine