
We present a new algorithm to compute the QR factorization of a matrix Am×n intended for use when m ? n. The algorithm uses a reduction strategy to perform the factorization which in turn allows a good degree of parallelism. It is then integrated into a parallel implementation of the QR factorization with column pivoting algorithm due to Golub and Van Loan, which allows the determination of the rank of A. The algorithms were coded in FORTRAN 90 using the MPI library. Results are presented for several different problem sizes on an IBM 9076 SP/2 parallel computer.
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 9 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
