✦ LIBER ✦

Computational Complexity || Non-negative Matrices and Digraphs

✍ Scribed by Meyers, Robert A.

Book ID: 118129721
Publisher: Springer New York
Year: 2012
Weight: 716 KB
Category: Article
ISBN: 1461418003
DOI: 10.1007/978-1-4614-1800-9_132

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Spectral Radius of Non-negative Matrices

Spectral Radius of Non-negative Matrices and Digraphs

✍ Xiao Dong Zhang; Jiong Sheng Li 📂 Article 📅 2002 🏛 Institute of Mathematics, Chinese Academy of Scien 🌐 English ⚖ 142 KB

Computing complex eigenvalues of large n

Computing complex eigenvalues of large non-Hermitian matrices

✍ W. Kerner; K. Lerbinger; J. Steuerwald 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 887 KB

The generalized eigenvalue problem Ax = hBx with a non-symmetric matrix A is solved by means of inverse vector iteration. The algorithm makes use of the band structure of the matrices, thus allowing quite large dimensions (d 5 3742). In the application all complex eigenvalues for the resistive Alfve

On computing minimal realizable spectral

On computing minimal realizable spectral radii of non-negative matrices

✍ Moody T. Chu; Shu-fang Xu 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 112 KB

SIA Matrices and Non-Negative Subdivisio

SIA Matrices and Non-Negative Subdivision

✍ Jetter, Kurt; Li, Xianjun 📂 Article 📅 2012 🏛 Springer 🌐 English ⚖ 293 KB

An algorithm for scaling matrices and co

An algorithm for scaling matrices and computing the minimum cycle mean in a digraph

✍ Manfred v. Golitschek 📂 Article 📅 1980 🏛 Springer-Verlag 🌐 English ⚖ 399 KB

Some negative results on the computation

Some negative results on the computational complexity of total variation and differentiation

✍ Ko Ker-I 📂 Article 📅 1982 🏛 Elsevier Science ⚖ 509 KB