In this paper we describe how to compute the eigenvalues of a unitary rank structured matrix in two steps. First we perform a reduction of the given matrix into Hessenberg form, next we compute the eigenvalues of this resulting Hessenberg matrix via an implicit QR-algorithm. Along the way, we explai
β¦ LIBER β¦
Computable eigenvalue bounds for rank-k perturbations
β Scribed by Jan H. Brandts; Ricardo Reis da Silva
- Publisher
- Elsevier Science
- Year
- 2010
- Tongue
- English
- Weight
- 250 KB
- Volume
- 432
- Category
- Article
- ISSN
- 0024-3795
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Eigenvalue computation for unitary rank
β
Steven Delvaux; Marc Van Barel
π
Article
π
2008
π
Elsevier Science
π
English
β 286 KB
Perturbation method for computing eigenv
β
Chen, Su-Huan ;Qiu, Ziping ;Liu, Zhongsheng
π
Article
π
1994
π
John Wiley and Sons
π
English
β 568 KB
Perturbation bounds for triangular and f
β
A. GalΓ‘ntai
π
Article
π
2005
π
Elsevier Science
π
English
β 408 KB
The perturbation bounds for eigenvalues
β
Wen Li; Weiwei Sun
π
Article
π
2005
π
John Wiley and Sons
π
English
β 73 KB
Optimal perturbation bounds for the Herm
β
Jesse L. Barlow; Ivan SlapniΔar
π
Article
π
2000
π
Elsevier Science
π
English
β 169 KB
There is now a large literature on structured perturbation bounds for eigenvalue problems of the form where H and M are Hermitian. These results give relative error bounds on the ith eigenvalue, Ξ» i , of the form and bound the error in the ith eigenvector in terms of the relative gap, In general,
Review of perturbation bounds for matrix
β
Raphael Loewy
π
Article
π
1992
π
Elsevier Science
π
English
β 415 KB