Skip to main content
SpringerLink
Log in

Parallel Algorithms for Computing Rank-Revealing QR Factorizations

  • Conference paper
Book cover Workshop on High Performance Computing and Gigabit Local Area Networks

Part of the book series: Lecture Notes in Control and Information Sciences ((LNCIS,volume 226))

Summary

The solution to many scientific and engineering problems requires the determination of the numerical rank of matrices. We present new parallel algorithms for computing rank-revealing QR (RRQR) factorizations of dense matrices on multicomputers, based on a serial approach developed by C. H. Bischof and G. Quintana-Ortí. The parallel implementations include the usual QR factorization with column pivoting, and a new faster approach that consists of two stages: a QR factorization with local column pivoting and a reliable rank-revealing algorithm appropriate for triangular matrices. Our parallel implementations include the BLAS-2 and BLAS-3 QR factorizations without pivoting since they are a good reference point, though they are not appropriate for rank-revealing purposes.

Experimental comparison shows considerable performance improvements of our new approach over classical rank-revealing algorithms on the platforms we used: an IBM SP2 platform and a cluster of SGI workstations.

We study the effect of the computer communication network and the processor computational power on the performance of the algorithms. In this case, as well as in many other parallel and distributed applications, the latency and bandwidth of the network are much more important than the processor computational power and, thus, these are the key factors impacting performance.

All authors were partially supported by the Spanish CICYT Project Grant TIC96-1062-C03-03.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliography

  1. E. Anderson, Z. Bai, C. H. Bischof, J. Demmel, J. Dongarra, J. DuCroz, A. Greenbaum, S. Hammarling, A. McKenney, S. Ostrouchov, and D. Sorensen, LAPACK User’s Guide Release 2.0, SIAM, Philadelphia, 1994.

    Google Scholar 

  2. C. H. Bischof, A block QR factorization algorithm using restricted pivoting in Proceedings SUPERCOMPUTING ‘89, Baltimore, Md., 1989, ACM Press, pp. 248–256.

    Google Scholar 

  3. C. H. Bischof, A parallel QR factorization algorithm with controlled local pivoting, SIAM J. on Scientific and Statistical Computing, 12 (1991), pp. 36–57.

    Article  MATH  MathSciNet  Google Scholar 

  4. C. H. Bischof and P. C. Hansen, Structure-Preserving and Rank’Revealing QR Factorizations, SIAM J. on Scientific and Statistical Computing, 12 (1989), pp. 1332–1350.

    Article  MathSciNet  Google Scholar 

  5. C. H. Bischof and G. Shroff, On updating signal subspaces, IEEE Trans, on Signal Processing, 40 (1992), pp. 96–105.

    Article  Google Scholar 

  6. C. H. Bischof and P. C. Hansen, A Block Algorithm for Computing Rank- Revealing QR Factorizations, Numerical Algorithms, 2 (1992), pp. 371–392.

    Article  MATH  MathSciNet  Google Scholar 

  7. C. H. Bischof and P. T. P. Tang, A robust incremental condition scheme, Argonne Preprint MCS-P225–0391, Mathematics and Computer Science Division, Argonne National Laboratory, 1991.

    Google Scholar 

  8. C. H. Bischof and G. Quintana-Orti Computing rank-revealing QR factorizations of dense matrices, Argonne Preprint MCS-P559–0196, Mathematics and Computer Science Division, Argonne National Laboratory, 1996.

    Google Scholar 

  9. C. H. Bischof and G. Quintana-Orti, Codes for rank-revealing QR factorizations of dense matrices, Argonne Preprint MCS-P560–0196, Mathematics and Computer Science Division, Argonne National Laboratory, 1996.

    Google Scholar 

  10. S. F. Hsieh, J. R. Liu, and K. Yao, Comparisons of Truncated QR and SVD methods for AR spectral estimations, in Proceedings SVD and Signal Processing II, 1991, Elsevier Science Publishers, pp. 403–418.

    Google Scholar 

  11. T. F. Chan, Rank-Revealing QR Factorizations, Linear Algebra & Appl., 88 /89 (1987), pp. 67–82.

    MathSciNet  Google Scholar 

  12. S. Chandrasekaran and I. Ipsen, On rank-revealing QR factorizations, SIAM J. on Matrix Analysis and Applications, 15 (1994), pp. 592–622.

    Article  MATH  MathSciNet  Google Scholar 

  13. M. Cosnard, J. M. Muller, and Y. Robert, Parallel QR decomposition of a rectangular matrix, Numerische Mathematik, 48 (1986), pp. 239–250.

    Article  MATH  MathSciNet  Google Scholar 

  14. J. J. Dongarra, J. R. Bunch, C. B. Moler, and G. W. Stewart, LIN- PACK Users’ Guide, SIAM Press, Philadelphia, 1979.

    Book  Google Scholar 

  15. J. J. Dongarra, A. Sameh, and D. Sorensen, Implementation of some concurrent algorithms for matrix factorization, Parallel Computing, 3 (1986), pp. 25–34.

    Article  MATH  Google Scholar 

  16. J. J. Dongarra, R. van de Geijn, and R. Whaley, Two dimensional basic linear algebra communication subprograms. Computer Science Dept. Technical Report CS-91–138, University of Tennessee, 1991 (LAPACK Working Note #37).

    Google Scholar 

  17. J. J. dongarra and d. Walker, The design of linear algebra libraries for high performance computers. Computer Science Dept. Technical Report CS-93–188, University of Tennessee, 1993 (LAPACK Working Note #58).

    Google Scholar 

  18. L. Elden and R. Schreiber, An application of systolic arrays to linear discrete ill-posed problems, SIAM J. on Scientific and Statistical Computing, 7 (1986), pp. 892–903.

    Article  MATH  Google Scholar 

  19. L. Eldén, A parallel QR decomposition algorithm, Report LiTh Mat R 1988–02, Dept. of Math., Linköping University, Sweden, 1988.

    Google Scholar 

  20. G. H. Golub and C. F. van Loan, Matrix Computations, The Johns Hopkins University Press, Baltimore, 2nd ed., 1989.

    Google Scholar 

  21. G. H. Golub, Numerical methods for solving linear least squares problems, Numerische Mathematik, 7 (1965), pp. 206–216.

    Article  MATH  MathSciNet  Google Scholar 

  22. G. H. Golub, P. Manneback, and P. L. Toint, A comparison between some direct and iterative methods for certain large scale geodetic least-squares problem, SIAM J. on Scientific and Statistical Computing, 7 (1986), pp. 799–816.

    Article  MATH  MathSciNet  Google Scholar 

  23. T. A. Grandine, An iterative method for computing multivariate C 1 piecewise polynomial interpolants, Computer Aided Geometric Design, 4 (1987), pp. 307–319.

    Article  MATH  MathSciNet  Google Scholar 

  24. T. A. Grandine, Rank deficient interpolation and optimal design: An example, Tech. Report SCA-TR-113, Boeing Computer Services, Engineering and Scientific Services Division, February 1989.

    Google Scholar 

  25. W. Gropp, E. Lusk, and A. Skjellum, Using MPI: Portable parallel programming with the message-passing interface, The MIT Press, Cambridge — Massachusetts, 1994.

    Google Scholar 

  26. M. Gu and S. Eisenstat, An efficient algorithm for computing a strong rank-revealing factorization, Tech. Report YALEU/DCS/RR-967, Yale University, Department of Computer Science, 1994.

    Google Scholar 

  27. P. C. Hansen, Truncated SVD solutions to discrete ill-posed problems with ill-determined numerical rank, SIAM J. on Matrix Analysis and Applications, 11 (1990), pp. 503–518.

    MATH  Google Scholar 

  28. P. C. Hansen, S. Takishi, and S. Hiromoto, The Modified Truncated SVD- Method for Regularization in General Form, SIAM J. on Scientific and Statistical Computing, 13 (1991), pp. 1142–1150.

    Article  Google Scholar 

  29. M. T. Heath and C. H. Romine. Parallel solution of triangular systems on distributed-memory multiprocessors. SIAM J. Scientific & Statistical Computing, 9, pp. 558–588, 1988.

    Article  MATH  MathSciNet  Google Scholar 

  30. G. Henry and R. van de Geijn. Parallelizing the QR algorithm for the unsymmetric algebraic eigenvalue problem: myths and reality. Lapack Working note #79, 1994.

    Google Scholar 

  31. I. C. F. Ipsen, Y. Saad and M. Schultz. Dense linear systems on a ring of processors. Linear Algebra and Its Appl., 77, pp. 205–239, 1986.

    Article  MATH  MathSciNet  Google Scholar 

  32. J. More, The Levenberg-Marquardt algorithm: Implementation and theory, in Proceedings of the Dundee Conference on Numerical Analysis, G. A. Watson (ed.), Berlin, 1978, Springer-Verlag.

    Google Scholar 

  33. D. P. O’Leary and G. W. Stewart. Assignment and scheduling in parallel matrix factorization. Linear Algebra and Its Appl., 77, pp. 275–300, 1986.

    Article  MATH  MathSciNet  Google Scholar 

  34. C.-T. Pan and P. T. P. Tang, Bounds on singular values revealed by QR factorization, Argonne Preprint MCS-P332–1092, Mathematics and Computer Science Division, Argonne National Laboratory, 1992.

    Google Scholar 

  35. A. Chtchelkanova, C. Edwards, J. Gunnels, G. Morrow, J. Overfelt, R. van de Geijn Towards Usable and Lean Parallel Linear Algebra Libraries PLAPACK Working Note #5, TR-96–09, Department of Computer Sciences, University of Texas, May 1996.

    Google Scholar 

  36. G. Quintana-Ortí, Algoritmos Secuenciales, por Bloques y Paralelos para el Cdlculo del Rango Numérico Matricial, Ph. D. Thesis, Universidad Politécnica de Valencia, 1995.

    Google Scholar 

  37. G. Quintana-Ortí, X. Sun, and C. H. Bischof, A BLAS-3 version of the QR factorization with column pivoting, Argonne Preprint MCS-P551–1295, Mathematics and Computer Science Division, Argonne National Laboratory, 1995.

    Google Scholar 

  38. G. Quintana-Ortí and E. S. Quintana-Ortí, Guaranteeing termination of Chandrasekaran & Ipsen’s algorithm for computing rank-revealing QR factorizations, Argonne Preprint MCS-P564–0196, Mathematics and Computer Science Division, Argonne National Laboratory, 1996.

    Google Scholar 

  39. J. Choi, J. J. Dongarra, D. W. Walker and R. C. Whaley, ScaLAPACK Reference Manual. Parallel Factorizations Routines (LU, QR, and Cholesky) and Parallel Reduction Routines (HRD, BRD, and TRD), Technical Memorandum ORNL/TM-12470, Oak Ridge National Laboratory, 1994, USA.

    Google Scholar 

  40. R. Schreiber and C. F. van Loan, A Storage Efficient WY Representation for Products of Householder Transformations, Scientific and Statistical Computing, 10 (1989), pp. 53–57.

    Article  MATH  Google Scholar 

  41. G. W. Stewart, Introduction to Matrix Computations, Academic Press, New York, 1973.

    MATH  Google Scholar 

  42. B. Waldén, Using a Fast Signal Processor to Solve the Inverse Kinematic Problem with Special Emphasis on the Singularity Problem, Ph.D. Thesis, Linköping University, Dept. of Mathematics, 1991.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Departamento de Informática, Universidad Jaime I, Campus Penyeta Roja, 12071, Castellón, Spain

    Gregorio Quintana-Ortí & Enrique S. Quintana-Ortí

Authors
  1. Gregorio Quintana-Ortí
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Enrique S. Quintana-Ortí
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. College of Computer Science, Northeastern University, M/S 215 CN, 02115, Boston, MA, USA

    G. Cooperman

  2. Institut für Experimentelle Mathematik, Universität GH Essen, Ellenstr. 29, D-45326, Essen, Germany

    G. Michler  & H. Vinck  & 

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag London

About this paper

Cite this paper

Quintana-Ortí, G., Quintana-Ortí, E.S. (1997). Parallel Algorithms for Computing Rank-Revealing QR Factorizations. In: Cooperman, G., Michler, G., Vinck, H. (eds) Workshop on High Performance Computing and Gigabit Local Area Networks. Lecture Notes in Control and Information Sciences, vol 226. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3540761691_9

Download citation

  • DOI: https://doi.org/10.1007/3540761691_9

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-76169-3

  • Online ISBN: 978-3-540-40937-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation