Estimating the numerical range with a Krylov subspace
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2024
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866929608492843008 |
|---|---|
| author | Chen, Cecilia Urschel, John |
| author_facet | Chen, Cecilia Urschel, John |
| contents | Krylov subspace methods are a powerful tool for efficiently solving high-dimensional linear algebra problems. In this work, we study the approximation quality that a Krylov subspace provides for estimating the numerical range of a matrix. In contrast to prior results, which often depend on the gaps between eigenvalues, our estimates depend only on the dimensions of the matrix and Krylov subspace, and the conditioning of the eigenbasis of the matrix. In addition, we provide nearly matching lower bounds for our estimates, illustrating the tightness of our arguments. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2411_19165 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Estimating the numerical range with a Krylov subspace Chen, Cecilia Urschel, John Numerical Analysis 15A60, 65F15, 65F50 Krylov subspace methods are a powerful tool for efficiently solving high-dimensional linear algebra problems. In this work, we study the approximation quality that a Krylov subspace provides for estimating the numerical range of a matrix. In contrast to prior results, which often depend on the gaps between eigenvalues, our estimates depend only on the dimensions of the matrix and Krylov subspace, and the conditioning of the eigenbasis of the matrix. In addition, we provide nearly matching lower bounds for our estimates, illustrating the tightness of our arguments. |
| title | Estimating the numerical range with a Krylov subspace |
| topic | Numerical Analysis 15A60, 65F15, 65F50 |
| url | https://arxiv.org/abs/2411.19165 |