Matrix Bounds on the Spectral Condition Number
โ Scribed by T.I. Fenner; G. Loizou
- Publisher
- Elsevier Science
- Year
- 1974
- Tongue
- English
- Weight
- 942 KB
- Volume
- 8
- Category
- Article
- ISSN
- 0024-3795
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
This paper deals with the normwise perturbation theory for linear (Hermitian) matrix equations. The definition of condition number for the linear (Hermitian) matrix equations is presented. The lower and upper bounds for the condition number are derived. The estimation for the optimal backward pertur
Fisher, D.C. and J. Ryan, Bounds on the number of complete subgraphs, Discrete Mathematics 103 (1992) 313-320. Let G be a graph with a clique number w. For 1 s s w, let k, be the number of complete j subgraphs on j nodes. We show that k,,, c (j~l)(kj/(~))u""'. This is exact for complete balanced w-