𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An upper bound for the spectral condition number of a diagonalizable matrix

✍ Scribed by Erxiong Jiang; Peter C.B. Lam

Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
382 KB
Volume
262
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

An upper bound for the path number of a
An upper bound for the path number of a graph
✍ Alan Donald πŸ“‚ Article πŸ“… 1980 πŸ› John Wiley and Sons 🌐 English βš– 529 KB

## Abstract The path number of a graph __G__, denoted __p(G)__, is the minimum number of edge‐disjoint paths covering the edges of __G.__ LovΓ‘sz has proved that if __G__ has __u__ odd vertices and __g__ even vertices, then __p(G)__ ≀ 1/2 __u__ + __g__ ‐ 1 ≀ __n__ ‐ 1, where __n__ is the total numbe

An upper bound for the permanent of a no
An upper bound for the permanent of a nonnegative matrix
✍ Suk-Geun Hwang; Arnold R. KrΓ€uter; T.S. Michael πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 311 KB

Let A be a fully indecomposable, nonnegative matrix of order n with row sums rt,..., ~;,, and let s~ equal the smallest positive element in row i of A. We prove the permanental inequality 11 II per(A) ~< 1-I s, + IX('"-s;) i::1 i::1 and characterize the case of equality. In 1984 Donald, Elwin, Hager