.png){kind=icon}
.png){kind=icon}
Return
PARALLEL TWO-STAGE REDUCTION TO HESSENBERG-TRIANGULAR FORM
.png){kind=icon}
OA
AI
DOI：10.1137/23M1547093.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We present a two-stage algorithm for the parallel reduction of a pencil to Hessenb erg- triangular form. Traditionally, two-stage Hessenberg-triangular reduction algorithms achieve high performance in the first stage but struggle to achieve high performance in the second stage. Our algorithm extends techniques described by Karlsson et al. [Parallel Comput., 37 (2011), pp. 771--782] to also achieve high performance in the second stage. Experiments in a shared memory environment demonstrate that the algorithm can outperform state-of-the-art sequential algorithms using parallel BLAS. Future work will need to determine whether our algorithm can also outperform parallelized versions of these algorithms.
Keywords:
words. generalized eigenvalues
Hessenb erg-triangular
parallel algorithm