Blocked algorithms for the reduction to Hessenberg-triangular form revisited
Impacto
Scholar |
Otros documentos de la autoría: Kagstrom, B.; Kressner, Daniel; Quintana-Orti, Enrique S.; Quintana-Ortí, Gregorio
Metadatos
Mostrar el registro completo del ítemcomunitat-uji-handle:10234/9
comunitat-uji-handle2:10234/7036
comunitat-uji-handle3:10234/8620
comunitat-uji-handle4:
INVESTIGACIONEste recurso está restringido
http://dx.doi.org/10.1007/s10543-008-0180-1 |
Metadatos
Título
Blocked algorithms for the reduction to Hessenberg-triangular form revisitedFecha de publicación
2008-09Editor
SpringerISSN
0006-3835Cita bibliográfica
BIT Numerical Mathematics, 48, 3, p. 563-584Tipo de documento
info:eu-repo/semantics/articleVersión de la editorial
http://link.springer.com/article/10.1007/s10543-008-0180-1Palabras clave / Materias
Resumen
We present two variants of Moler and Stewart’s algorithm for reducing a matrix pair to Hessenberg-triangular (HT) form with increased data locality in the access to the matrices. In one of these variants, a careful ... [+]
We present two variants of Moler and Stewart’s algorithm for reducing a matrix pair to Hessenberg-triangular (HT) form with increased data locality in the access to the matrices. In one of these variants, a careful reorganization and accumulation of Givens rotations enables the use of efficient level 3 BLAS. Experimental results on four different architectures, representative of current high performance processors, compare the performances of the new variants with those of the implementation of Moler and Stewart’s algorithm in subroutine DGGHRD from LAPACK, Dackland and Kågström’s two-stage algorithm for the HT form, and a modified version of the latter which requires considerably less flops. [-]
Derechos de acceso
copyright Springer 2008
http://rightsstatements.org/vocab/InC/1.0/
info:eu-repo/semantics/restrictedAccess
http://rightsstatements.org/vocab/InC/1.0/
info:eu-repo/semantics/restrictedAccess
Aparece en las colecciones
- ICC_Articles [420]