No label defined (Q5717271)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2246263
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 2246263 |
Statements
12 January 2006
0 references
spectral norm
0 references
lower bounds
0 references
complexity
0 references
0.7872456312179565
0 references
0.7773382663726807
0 references
0.7728775143623352
0 references
0.7728775143623352
0 references
For an \(n\times m\) complex matrix there are found simple and effective lower bounds for the spectral norm. Among them: \[ \| A\| \geqslant (\frac {| r_1| ^2+\dotsc +| r_n| ^2}n)^{1/2}, \] where \(r_1,\dots, r_n\) are the row sums of \(A\); \[ \| A\| \geqslant \frac 1{\sqrt 2} \bigl\{ \| \text{\textbf{a}}_i\| ^2+\| \text{\textbf{a}}_k\| ^2 +[(\| \text{\textbf{a}}_i\| ^2-\| \text{\textbf{a}}_k\| ^2)^2 +4| \text{\textbf{a}}^*_i \text{\textbf{a}}_k| ^2]^{1/2} \bigr\}^{1/2}, \] where \((\text{\textbf{a}}_1, \dotsc, \text{\textbf{a}}_n)\) is the partition of \(A\) into columns; \[ \| A\| \geqslant \frac {\| (\sum_j \text{\textbf{a}}_j \text{\textbf{a}}_j^*)\text{\textbf{r}}\| } { \| (\text{\textbf{a}}_1^*\text{\textbf{r}} \dots \text{\textbf{a}}_n^* \text{\textbf{r}})^T\| },\text{ where }\text{\textbf{r}}= (r_1,\dots, r_n)^T. \] These bounds are studied on hundreds of randomly chosen matrices; the bounds are proved to be suprisingly good. They all have complexity \(O(n^2)\), and the best \(O(n^2)\) bound which is presented here seems to be better than all \(O(n^2)\) bounds found in the literature.
0 references