arXiv Analytics

Sign in

arXiv:2410.22014 [math.NA]AbstractReferencesReviewsResources

A preconditioning technique of Gauss--Legendre quadrature for the logarithm of symmetric positive definite matrices

Fuminori Tatsuoka, Tomohiro Sogabe, Tomoya Kemmochi, Shao-Liang Zhang

Published 2024-10-29Version 1

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$.

Related articles: Most relevant | Search more
arXiv:2106.13034 [math.NA] (Published 2021-06-24)
The condition number of many tensor decompositions is invariant under Tucker compression
arXiv:2203.03930 [math.NA] (Published 2022-03-08)
Integral representations for higher-order Fréchet derivatives of matrix functions: Quadrature algorithms and new results on the level-2 condition number
arXiv:2501.00245 [math.NA] (Published 2024-12-31)
Localized Estimation of Condition Numbers for MILU Preconditioners on a Graph