1980
DOI: 10.1016/0024-3795(80)90201-3
|View full text |Cite
|
Sign up to set email alerts
|

More bounds for elgenvalues using traces

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2009
2009
2023
2023

Publication Types

Select...
5
1
1

Relationship

1
6

Authors

Journals

citations
Cited by 37 publications
(3 citation statements)
references
References 8 publications
0
3
0
Order By: Relevance
“…The density of this sum is a convolution which is bounded by O( 1 λmax ) (after a small calculation). Moreover, by Theorem 2.1 of Wolkowicz and Styan (1980) we know that…”
Section: Appendix F Rate Of Convergencementioning
confidence: 96%
“…The density of this sum is a convolution which is bounded by O( 1 λmax ) (after a small calculation). Moreover, by Theorem 2.1 of Wolkowicz and Styan (1980) we know that…”
Section: Appendix F Rate Of Convergencementioning
confidence: 96%
“…Theorem2 indicates that the exact eigenvalue and multiplicities of an orthogonal matrix with cube being symmetric could be obtained by Eqs. (3), which only relates to trace of matrices, avoiding to calculate the characteristic polynomials.…”
Section: Proof For the Necessity If The All Possible Eigenvalue Ofmentioning
confidence: 99%
“…A scalar λ is called an eigenvalue of an n × n complex matrix A if there is a nontrivial solution x of Ax = λx [1]. The eigenvalues of a matrix A are the roots of the det(A − λE) = 0 and so are difficult to evaluate in general [2,3]. " Computer softwares such as Mathematica and Maple can use symbolic calculations to find the characteristic polynomial of a moderatesized matrix" [4].…”
Section: Introductionmentioning
confidence: 99%