Error analysis of two algorithms for the computation of the matrix exponential (Q1207776): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Added link to MaRDI item.
links / mardi / namelinks / mardi / name
 

Revision as of 06:24, 31 January 2024

scientific article
Language Label Description Also known as
English
Error analysis of two algorithms for the computation of the matrix exponential
scientific article

    Statements

    Error analysis of two algorithms for the computation of the matrix exponential (English)
    0 references
    0 references
    0 references
    0 references
    24 May 1993
    0 references
    This paper investigates the roundoff and truncation errors for the Taylor series of a matrix exponential. If the norm of the matrix \(A\) is less than one, the roundoff error grows linearly with respect to its size and norm; otherwise it grows exponentially. Hence for \(A\) with \(\| A\|\geq 1\) a scaling and squaring algorithm is introduced for \(m^{-1}A\) where \(m\) is a sufficiently large integer to give \(\| m^{-1}A\| < 1\): Compute the truncated Taylor series of \(m^{-1}A\) and raise it to the \(m\)-th power, where for ease of computations, \(m\) is chosen as a power of two. In the final analysis, the scaling and squaring algorithm is shown to be stable for all \(A\).
    0 references
    0 references
    matrix exponential
    0 references
    roundoff error
    0 references
    scaling and squaring algorithm
    0 references
    truncated Taylor series
    0 references

    Identifiers