|
Descripción
|
|
|---|---|
| Ikebe algorithm for computing the lower half of the inverse of any (unreduced) upper Hessenberg matrix is extended here to compute the entries of the superdiagonal. It gives rise to an algorithm of inversion based on the factorization H?1 = HL ?U?1. The lower Hessenberg matrix HL is a quasiseparable one and U?1 is upper triangular, with diagonal entries ui;i = 1. Its computational complexity, O(n3), is connected with back substitution for the inversion of the matrix U. Moreover, the inverses of quasiseparable Hessenberg matrices are obtained in O(n2) times. Numerical comparisons with other specialized algorithms of inversion are also introduced. | |
|
Internacional
|
Si |
|
DOI
|
|
|
Edición del Libro
|
|
|
Editorial del Libro
|
|
|
ISBN
|
978-84-615-5392-1 |
|
Serie
|
|
|
Título del Libro
|
Proceedings of the 12th International Conference on Computational and Mathematical Methods in Science and Engineering, CMMSE 2012 |
|
Desde página
|
23 |
|
Hasta página
|
26 |