✦ LIBER ✦

A Method for the Computation of the Greatest Root of a Positive Matrix

✍ Scribed by Brauer, Alfred

Book ID: 118196275
Publisher: Society for Industrial and Applied Mathematics
Year: 1957
Weight: 337 KB
Volume: 5
Category: Article
ISSN: 0368-4245
DOI: 10.1137/0105018

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Method for the Computation of the Grea

A Method for the Computation of the Greatest Root of a Nonnegative Matrix

✍ Alfred Brauer 📂 Article 📅 1966 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 164 KB

Bounds for the Greatest Latent Root of a

Bounds for the Greatest Latent Root of a Positive Matrix

✍ Ostrowski, A. 📂 Article 📅 1952 🏛 Oxford University Press 🌐 English ⚖ 97 KB

Bounds for the Greatest Latent Roots of

Bounds for the Greatest Latent Roots of a Positive Matrix

✍ Ledermann, W. 📂 Article 📅 1950 🏛 Oxford University Press 🌐 English ⚖ 95 KB

Selective computation. II. The positive

Selective computation. II. The positive definite square root of a positive definite matrix

✍ Richard Bellman 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 90 KB

Bounds for the greatest characteristic r

Bounds for the greatest characteristic root of a nonnegative matrix

✍ Shu-Lin Liu 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 446 KB

New bounds for the greatest characteristic root of a nonnegative matrix are obtained. They generalize and improve the bounds of G. Frobenius and H. Mint. 1. INTRODUCTION Let .4 = (u,~> be a nonnegative matrix of order n, and rr, r2,. . . , rn its row sums. The following results of Frobenius [I] are

A new differential equation method for f

A new differential equation method for finding the Perron root of a positive matrix

✍ R. Kalaba; K. Spingarn; L. Tesfatsion 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 409 KB