A condition for the convexity of the norm-numerical range of a matrix
โ Scribed by B.David Saunders
- Publisher
- Elsevier Science
- Year
- 1977
- Tongue
- English
- Weight
- 566 KB
- Volume
- 16
- Category
- Article
- ISSN
- 0024-3795
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
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
The absence of atoms in Lyapunov's Convexity Theorem is a sufficient, but not a necessary condition for the convexity of the range of an n-dimensional vector memure. In this paper algebraic and topological convexity conditions generalizing Lyapunov's Theorem are developed which are sufficient and ne