A preconditioning technique of Gauss--Legendre quadrature for the logarithm of symmetric positive definite matrices
Fuente:
arXiv
Guardado en:
| Autores principales: | , , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866909538135834624 |
|---|---|
| author | Tatsuoka, Fuminori Sogabe, Tomohiro Kemmochi, Tomoya Zhang, Shao-Liang |
| author_facet | Tatsuoka, Fuminori Sogabe, Tomohiro Kemmochi, Tomoya Zhang, Shao-Liang |
| contents | This note considers the computation of the logarithm of symmetric positive definite matrices using the Gauss--Legendre (GL) quadrature. The GL quadrature becomes slow when the condition number of the given matrix is large. In this note, we propose a technique dividing the matrix logarithm into two matrix logarithms, where the condition numbers of the divided logarithm arguments are smaller than that of the original matrix. Although the matrix logarithm needs to be computed twice, each computation can be performed more efficiently, and it potentially reduces the overall computational cost. It is shown that the proposed technique is effective when the condition number of the given matrix is approximately between $130$ and $3.0\times 10^5$. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2410_22014 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | A preconditioning technique of Gauss--Legendre quadrature for the logarithm of symmetric positive definite matrices Tatsuoka, Fuminori Sogabe, Tomohiro Kemmochi, Tomoya Zhang, Shao-Liang Numerical Analysis This note considers the computation of the logarithm of symmetric positive definite matrices using the Gauss--Legendre (GL) quadrature. The GL quadrature becomes slow when the condition number of the given matrix is large. In this note, we propose a technique dividing the matrix logarithm into two matrix logarithms, where the condition numbers of the divided logarithm arguments are smaller than that of the original matrix. Although the matrix logarithm needs to be computed twice, each computation can be performed more efficiently, and it potentially reduces the overall computational cost. It is shown that the proposed technique is effective when the condition number of the given matrix is approximately between $130$ and $3.0\times 10^5$. |
| title | A preconditioning technique of Gauss--Legendre quadrature for the logarithm of symmetric positive definite matrices |
| topic | Numerical Analysis |
| url | https://arxiv.org/abs/2410.22014 |