✦ LIBER ✦

An improvement on perturbation bounds for the Drazin inverse

✍ Scribed by Yimin Wei; Xiezhang Li

Publisher: John Wiley and Sons
Year: 2003
Tongue: English
Weight: 110 KB
Volume: 10
Category: Article
ISSN: 1070-5325
DOI: 10.1002/nla.336

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Note on Variance Bounds for an Inverse

A Note on Variance Bounds for an Inverse Binomial Estimator

✍ Dr. A. Sahai 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 118 KB 👁 2 views

BEST (1974) found the variance of the minimum variance unbiased estimator of the Bernoulli parameter with an inverse sample. Noting its intricacy MIKULSKI and SMITE (1976) found bounds on this variance. SATEE (1977) developed closer bounds on it. In this paper still closer upper bound on the varianc

An improved bound for the strong chromat

An improved bound for the strong chromatic number

✍ P. E. Haxell 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 156 KB 👁 1 views

## Abstract Let η > 0 be given. Then there exists __d__~0~ = __d__~0~(η) such that the following holds. Let __G__ be a finite graph with maximum degree at most __d__ ≥ __d__~0~ whose vertex set is partitioned into classes of size α __d__, where α≥ 11/4 + η. Then there exists a proper coloring of __

An improved upper bound on the crossing

An improved upper bound on the crossing number of the hypercube

✍ Luerbio Faria; Celina Miraglia Herrera de Figueiredo; Ondrej Sýkora; Imrich Vrt' 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 288 KB

## Abstract We draw the __n__‐dimensional hypercube in the plane with ${5\over 32}4^{n}-\lfloor{{{{n}^{2}+1}\over 2}}\rfloor {2}^{n-2}$ crossings, which improves the previous best estimation and coincides with the long conjectured upper bound of Erdös and Guy. © 2008 Wiley Periodicals, Inc. J Graph

Bounds on the real stability radius for

Bounds on the real stability radius for affinely perturbed differential-algebraic systems

✍ M. Bracke; D. Prätzel-Wolters 📂 Article 📅 2002 🏛 John Wiley and Sons ⚖ 127 KB 👁 2 views

An improved edge bound on the interval n

An improved edge bound on the interval number of a graph

✍ Jeremy R. Spinrad; G. Vijayan; Douglas B. West 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 147 KB 👁 2 views

The upper bound on the interval number of a graph in terms of its number of edges is improved. Also, the interval number of graphs in hereditary classes is bounded in terms of the vertex degrees. A representation of a graph as an intersection graph assigns each vertex a set such that vertices are a

ACCORD-ADEQUATE: an improved technique f

ACCORD-ADEQUATE: an improved technique for the acquisition of inverse-detected INADEQUATE data

✍ R. Thomas Williamson; Brian L. Marquez; William H. Gerwick; Frank E. Koehn 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 244 KB

## Abstract A new approach for the acquisition of ^1^H‐detected INADEQUATE‐type data is presented. This method uses a decremented variable delay for the evolution of ^1^__J__~(C,C)~ couplings. It is demonstrated that this variation of the 1,1‐ADEQUATE experiment provides superior performance when c