Error complexity analysis of two algorithms for computing powers of arbitrary Hessenberg matrices

DOI10.1016/0016-0032(86)90038-4MaRDI QIDQ1090071zbMATH OpenOpenAlexFDO

Authors Nai-Kuan Tsao

Publication date 1986

Published in Journal of the Franklin Institute (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0016-0032(86)90038-4

zbMATH Keywords

error complexity analysisHessenberg matrixinner product type algorithmmatrix powersroundoff error analysisstandard matrix multiplication

Mathematics Subject Classification ID

Roundoff error (65G50)

Review text

The author shows that the standard matrix multiplication method for computing powers of a Hessenberg matrix has a better guaranteed numerical accuracy than a new efficient algorithm proposed by \textit{C. P. Huang} [Linear Algebra Appl. 21, 123-134 (1978; Zbl 0396.15002)]. Moreover, examples are given which demonstrate that even low order powers of a Hessenberg matrix with small superdiagonal elements computed by the new method are incorrect when floating point computations are used.

Recommendations

• Computing powers of arbitrary Hessenberg matrices
• A Schur-Padé algorithm for fractional powers of a matrix
• Error analysis of two algorithms for the computation of the matrix exponential
• Numerical algorithms for the determinant evaluation of general Hessenberg matrices
• scientific article; zbMATH DE number 4145232

Cites work

• Computing powers of arbitrary Hessenberg matrices
• Error Complexity Analysis of Algorithms for Matrix Multiplication and Matrix Chain Product
• scientific article; zbMATH DE number 3183375 (Why is no real title available?)

Cited in

(2)

• Computing powers of arbitrary Hessenberg matrices
• Comparison of the Computational Cost of a Monte Carlo and Deterministic Algorithm for Computing Bilinear Forms of Matrix Powers

This page was built for publication: Error complexity analysis of two algorithms for computing powers of arbitrary Hessenberg matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1090071)