Computing the Matrix Sign and Absolute Value Functions - Archive ouverte HAL Access content directly
Journal Articles Comptes Rendus. Mathématique Year : 2008

Computing the Matrix Sign and Absolute Value Functions

(1)
1

Abstract

We present two algorithms for the computation of the matrixsign and absolute value functions.Both algorithms avoid a complete diagonalisation of thematrix, but they however require some informations regarding the eigenvalues location.The first algorithm consists in a sequence of polynomial iterations based on appropriate estimates of the eigenvalues, andconverging to the matrix sign if all the eigenvalues are real.Convergence is obtained within a finite number of steps when the eigenvalues are exactly known.Nevertheless, we present a second approach for the computation of the matrix sign and absolute value functions, when the eigenvalues are exactly known.This approach is based on the resolution of an interpolation problem, can handle the case of complex eigenvalues and appears to be faster than the iterative approach.

Dates and versions

cea-02355780 , version 1 (08-11-2019)

Identifiers

Cite

M. Ndjinga. Computing the Matrix Sign and Absolute Value Functions. Comptes Rendus. Mathématique, 2008, 1, ⟨10.1016/j.crma.2007.11.028⟩. ⟨cea-02355780⟩

Collections

CEA DEN
23 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More