A BLAS-3 version of the QR factorization with column pivoting


Journal Article

The QR factorization with column pivoting (QRP), originally suggested by Golub [Numer. Math., 7 (1965), 206-216], is a popular approach to computing rank-revealing factorizations. Using Level 1 BLAS, it was implemented in LINPACK, and, using Level 2 BLAS, in LAPACK. While the Level 2 BLAS version delivers superior performance in general, it may result in worse performance for large matrix sizes due to cache effects. We introduce a modification of the QRP algorithm which allows the use of Level 3 BLAS kernels while maintaining the numerical behavior of the LINPACK and LAPACK implementations. Experimental comparisons of this approach with the LINPACK and LAPACK implementations on IBM RS/6000, SGI R8000, and DEC AXP platforms show considerable performance improvements.

Full Text

Duke Authors

Cited Authors

  • Quintana-Ortí, G; Sun, X; Bischof, CH

Published Date

  • January 1, 1998

Published In

Volume / Issue

  • 19 / 5

Start / End Page

  • 1486 - 1494

International Standard Serial Number (ISSN)

  • 1064-8275

Digital Object Identifier (DOI)

  • 10.1137/S1064827595296732

Citation Source

  • Scopus