✦ LIBER ✦

A best upper bound for the 2-norm condition number of a matrix

✍ Scribed by Jorma Kaarlo Merikoski; Uoti Urpala; Ari Virtanen; Tin-Yau Tam; Frank Uhlig

Publisher: Elsevier Science
Year: 1997
Tongue: English
Weight: 468 KB
Volume: 254
Category: Article
ISSN: 0024-3795
DOI: 10.1016/s0024-3795(96)00474-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An upper bound for the spectral conditio

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

✍ Erxiong Jiang; Peter C.B. Lam 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 382 KB

Erratum to “An upper bound for the condi

Erratum to “An upper bound for the condition number of a matrix in spectral norm” [J. Comput. Appl. Math. 143 (2002) 141–144]

✍ Ayşe Dilek Güngör 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 178 KB

Minimization of the norm, the norm of th

Minimization of the norm, the norm of the inverse and the condition number of a matrix by completion

✍ Ludwig Elsner; Chunyang He; Volker Mehrmann 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 640 KB

We study the problem of minimizing the norm, the norm of the inverse and the condition number with respect to the spectral norm, when a submatrix of a matrix can be chosen arbitrarily. For the norm minimization problem we give a different proof than that given by Davis/Kahan/Weinberger. This new app

A condition for the convexity of the nor

A condition for the convexity of the norm-numerical range of a matrix

✍ B.David Saunders 📂 Article 📅 1977 🏛 Elsevier Science 🌐 English ⚖ 566 KB

A bound for the condition of a hyperboli

A bound for the condition of a hyperbolic eigenvector matrix

✍ Ivan Slapničar; Krešimir Veselić 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 317 KB

The hyperbolic eigenvector matrix is a matrix X which simultaneously diagonalizes the pair (H,J), where H is Hermitian positive definite and J = diag(:E1) such that X\*HX = A and X\*JX = J. We prove that the spectral condition of X, r(X), is bounded by K(X) ~< ~/min x(D\*HD), where the minimum is ta

A new upper bound for the harmonious chr

A new upper bound for the harmonious chromatic number

✍ Edwards, Keith 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 200 KB 👁 2 views

A harmonious coloring of a simple graph G is a proper vertex coloring such that each pair of colors appears together on at most one edge. The harmonious chromatic number h(G) is the least number of colors in such a coloring. We obtain a new upper bound for the harmonious chromatic number of general