zbMATH — the first resource for mathematics

Approximating the logarithm of a matrix to specified accuracy. (English) Zbl 0989.65057
From the authors’ abstract: The standard inverse scaling and squaring algorithm for computing the matrix logarithm begins by transforming the matrix to Schur triangular form in order to facilitate subsequent matrix square root and Padé approximation computations. A transformation-free form of this method that exploits incomplete Denman-Beavers square root iterations and aims for a specified accuracy (ignoring roundoff) is presented. The error introduced by using approximate square roots is accounted for by a novel splitting lemma for logarithms of matrix products. The number of square root stages and the degree of the final Padé approximation are chosen to minimize the computational work. This new method is attractive for high-performance computation since it uses only the basic building blocks of matrix multiplication, LU factorization and matrix inversion.

65F30 Other matrix algorithms (MSC2010)
15A24 Matrix equations and identities
Full Text: DOI