Improving the unsymmetric parallel QR algorithm on vector machines
Conference
·
OSTI ID:54427
- Cornell Univ., Ithaca, NY (United States)
We present some theoretical and computational improvements to the single/double shift QR algorithm on vector machines. The improvement involves a lookahead algorithm that obtains vector performance better than the high multiplicity shift QR. The strategies presented are numerically similar to those found in such libraries as LAPACK and EISPACK. We provide tests to show improved timings against LAPACK, ESSL, and the vector version of EISPACK on an IBM 3090/VF. We also provide theorems to show theoretical complexity improvements.
- OSTI ID:
- 54427
- Report Number(s):
- DOE/ER/25151--1-Vol.1; CONF-930331--Vol.1
- Country of Publication:
- United States
- Language:
- English
Similar Records
Conjugate-gradient subroutines for the IBM 3090 Vector Facility
Fourier transform and convolution subroutines for the IBM 3090 Vector Facility
Computing rank-revealing QR factorizations of dense matrices.
Journal Article
·
Tue Feb 28 23:00:00 EST 1989
· IBM J. Res. Dev.; (United States)
·
OSTI ID:5871884
Fourier transform and convolution subroutines for the IBM 3090 Vector Facility
Journal Article
·
Fri Feb 28 23:00:00 EST 1986
· IBM J. Res. Dev.; (United States)
·
OSTI ID:5569169
Computing rank-revealing QR factorizations of dense matrices.
Journal Article
·
Mon Jun 01 00:00:00 EDT 1998
· ACM Trans. Math. Software
·
OSTI ID:937863