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

DOI10.1016/0016-0032(86)90038-4zbMath0621.65042OpenAlexW2018041154MaRDI QIDQ1090071

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

roundoff error analysisstandard matrix multiplicationHessenberg matrixmatrix powerserror complexity analysisinner product type algorithm

Mathematics Subject Classification ID

Cites Work

• Unnamed Item
• Computing powers of arbitrary Hessenberg matrices
• Error Complexity Analysis of Algorithms for Matrix Multiplication and Matrix Chain Product

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