A low-memory Lanczos method with rational Krylov compression for matrix functions
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866910357144993792 |
|---|---|
| author | Casulli, Angelo A. Simunec, Igor |
| author_facet | Casulli, Angelo A. Simunec, Igor |
| contents | In this work we introduce a memory-efficient method for computing the action of a Hermitian matrix function on a vector. Our method consists of a rational Lanczos algorithm combined with a basis compression procedure based on rational Krylov subspaces that only involve small matrices. The cost of the compression procedure is negligible with respect to the cost of the Lanczos algorithm. This enables us to avoid storing the whole Krylov basis, leading to substantial reductions in memory requirements. This method is particularly effective when the rational Lanczos algorithm needs a significant number of iterations to converge and each iteration involves a low computational effort. This scenario often occurs when polynomial Lanczos, as well as extended and shift-and-invert Lanczos are employed. Theoretical results prove that, for a wide variety of functions, the proposed algorithm differs from rational Lanczos by an error term that is usually negligible. The algorithm is compared with other low-memory Krylov methods from the literature on a variety of test problems, showing competitive performance. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2403_04390 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | A low-memory Lanczos method with rational Krylov compression for matrix functions Casulli, Angelo A. Simunec, Igor Numerical Analysis 65F60, 65F50 In this work we introduce a memory-efficient method for computing the action of a Hermitian matrix function on a vector. Our method consists of a rational Lanczos algorithm combined with a basis compression procedure based on rational Krylov subspaces that only involve small matrices. The cost of the compression procedure is negligible with respect to the cost of the Lanczos algorithm. This enables us to avoid storing the whole Krylov basis, leading to substantial reductions in memory requirements. This method is particularly effective when the rational Lanczos algorithm needs a significant number of iterations to converge and each iteration involves a low computational effort. This scenario often occurs when polynomial Lanczos, as well as extended and shift-and-invert Lanczos are employed. Theoretical results prove that, for a wide variety of functions, the proposed algorithm differs from rational Lanczos by an error term that is usually negligible. The algorithm is compared with other low-memory Krylov methods from the literature on a variety of test problems, showing competitive performance. |
| title | A low-memory Lanczos method with rational Krylov compression for matrix functions |
| topic | Numerical Analysis 65F60, 65F50 |
| url | https://arxiv.org/abs/2403.04390 |