Parallel Two-Stage Reduction of a Regular Matrix Pair to Hessenberg-Triangular Form

Authors:
Björn Adlerborn;Krister Dackland;Bo Kågström
Affiliations:
-;-;-
Venue:
PARA '00 Proceedings of the 5th International Workshop on Applied Parallel Computing, New Paradigms for HPC in Industry and Academia
Year:
2000

Citing 7
Cited 3

A storage-efficient WY representation for products of householder transformations

SIAM Journal on Scientific and Statistical Computing
ScaLAPACK user's guide

ScaLAPACK user's guide
LAPACK Users' guide (third ed.)

LAPACK Users' guide (third ed.)
Blocked algorithms and software for reduction of a regular matrix pair to generalized Schur form

ACM Transactions on Mathematical Software (TOMS)
Reduction of a Regular Matrix Pair (A, B) to Block Hessenberg Triangular Form

PARA '95 Proceedings of the Second International Workshop on Applied Parallel Computing, Computations in Physics, Chemistry and Engineering Science
A Hierarchical Approach for Performance Analysis of ScaLAPACK-Based Routines Using the Distributed Linear Algebra Machine

PARA '96 Proceedings of the Third International Workshop on Applied Parallel Computing, Industrial Computation and Optimization
A ScaLAPACK-Style Algorithm for Reducing a Regular Matrix Pair to Block Hessenberg-Triangular Form

PARA '98 Proceedings of the 4th International Workshop on Applied Parallel Computing, Large Scale Scientific and Industrial Problems

Parallel and Blocked Algorithms for Reduction of a Regular Matrix Pair to Hessenberg-Triangular and Generalized Schur Forms

PARA '02 Proceedings of the 6th International Conference on Applied Parallel Computing Advanced Scientific Computing
Parallel Solvers for Sylvester-Type Matrix Equations with Applications in Condition Estimation, Part I: Theory and Algorithms

ACM Transactions on Mathematical Software (TOMS)
Efficient reduction from block hessenberg form to hessenberg form using shared memory

PARA'10 Proceedings of the 10th international conference on Applied Parallel and Scientific Computing - Volume 2

Quantified Score

Hi-index	0.00

Visualization

Abstract

A parallel two-stage algorithm for reduction of a regular matrix pair (A,B) to Hessenberg-triangular form (H, T) is presented. Stage one reduces the matrix pair to a block upper Hessenberg-triangular form (Hr, T), where Hr is upper r-Hessenberg with r 1 subdiagonals and T is upper triangular. In stage two, the desired upper Hessenberg-triangular form is computed using two-sided Givens rotations. Performance results for the ScaLAPACK-style implementations show that the parallel algorithms can be used to solve large scale problems effectively.