Error Estimates for the Arnoldi Approximation of a Matrix Square Root
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , , |
|---|---|
| Format: | Preprint |
| Publié: |
2025
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866911398307561472 |
|---|---|
| author | Adler, James H. Hu, Xiaozhe Pan, Wenxiao Xue, Zhongqin |
| author_facet | Adler, James H. Hu, Xiaozhe Pan, Wenxiao Xue, Zhongqin |
| contents | The Arnoldi process provides an efficient framework for approximating functions of a matrix applied to a vector, i.e., of the form $f(M)\bm{b}$, by repeated matrix-vector multiplications. In this paper, we derive error estimates for approximating the action of a matrix square root using the Arnoldi process, where the integral representation of the error is reformulated in terms of the error for solving the linear system $M\bm{x}=\bm{b}$. The results extend the error analysis of the Lanczos method for Hermitian matrices in [Chen et al., SIAM J. Matrix Anal. Appl., 2022] to non-Hermitian cases and provide an improved bound for the Hermitian case. Furthermore, in practical settings, the matrix may only be available via approximate or structured representations. Motivated by this, we extend the analysis and establish a generalized error bound for perturbed matrices. The numerical results on matrices with different structures demonstrate that our theoretical analysis yields a reliable upper bound. Finally, simulations on large-scale matrices arising in particulate suspensions, represented in hierarchical matrix form, validate the effectiveness and practicality of the approach. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2506_22615 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Error Estimates for the Arnoldi Approximation of a Matrix Square Root Adler, James H. Hu, Xiaozhe Pan, Wenxiao Xue, Zhongqin Numerical Analysis 65F60 65Z05 70-10 The Arnoldi process provides an efficient framework for approximating functions of a matrix applied to a vector, i.e., of the form $f(M)\bm{b}$, by repeated matrix-vector multiplications. In this paper, we derive error estimates for approximating the action of a matrix square root using the Arnoldi process, where the integral representation of the error is reformulated in terms of the error for solving the linear system $M\bm{x}=\bm{b}$. The results extend the error analysis of the Lanczos method for Hermitian matrices in [Chen et al., SIAM J. Matrix Anal. Appl., 2022] to non-Hermitian cases and provide an improved bound for the Hermitian case. Furthermore, in practical settings, the matrix may only be available via approximate or structured representations. Motivated by this, we extend the analysis and establish a generalized error bound for perturbed matrices. The numerical results on matrices with different structures demonstrate that our theoretical analysis yields a reliable upper bound. Finally, simulations on large-scale matrices arising in particulate suspensions, represented in hierarchical matrix form, validate the effectiveness and practicality of the approach. |
| title | Error Estimates for the Arnoldi Approximation of a Matrix Square Root |
| topic | Numerical Analysis 65F60 65Z05 70-10 |
| url | https://arxiv.org/abs/2506.22615 |