You are here: MIMS > EPrints
MIMS EPrints

2006.142: Approximating the logarithm of a matrix to specified accuracy

2006.142: Sheung Hun Cheng, Nicholas J Higham, Charles S Kenney and Alan J Laub (2001) Approximating the logarithm of a matrix to specified accuracy. SIAM Journal On Matrix Analysis And Applications, 22 (4). pp. 1112-1125. ISSN 1095-7162

Full text available as:

PDF - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
177 Kb

DOI: 10.1137/S0895479899364015


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.

Item Type:Article
Uncontrolled Keywords:matrix logarithm, Pade approximation, inverse scaling and squaring method, matrix square root, Denman--Beavers iteration
Subjects:MSC 2000 > 15 Linear and multilinear algebra; matrix theory
MSC 2000 > 65 Numerical analysis
MIMS number:2006.142
Deposited By:Miss Louise Stait
Deposited On:27 June 2006

Download Statistics: last 4 weeks
Repository Staff Only: edit this item