Polynomial approximations for the matrix logarithm with computation graphs
CoRR(2024)
摘要
The most popular method for computing the matrix logarithm is a combination
of the inverse scaling and squaring method in conjunction with a Padé
approximation, sometimes accompanied by the Schur decomposition. The main
computational effort lies in matrix-matrix multiplications and left matrix
division. In this work we illustrate that the number of such operations can be
substantially reduced, by using a graph based representation of an efficient
polynomial evaluation scheme. A technique to analyze the rounding error is
proposed, and backward error analysis is adapted. We provide substantial
simulations illustrating competitiveness both in terms of computation time and
rounding errors.
更多查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要