Error complexity analysis of two algorithms for computing powers of arbitrary Hessenberg matrices (Q1090071)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4007586
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Error complexity analysis of two algorithms for computing powers of arbitrary Hessenberg matrices |
scientific article; zbMATH DE number 4007586 |
Statements
Error complexity analysis of two algorithms for computing powers of arbitrary Hessenberg matrices (English)
0 references
1986
0 references
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.
0 references
error complexity analysis
0 references
inner product type algorithm
0 references
roundoff error analysis
0 references
matrix powers
0 references
standard matrix multiplication
0 references
Hessenberg matrix
0 references
0.7670053243637085
0 references
0.7337886095046997
0 references
0.723000705242157
0 references
0.7215834856033325
0 references
