Extensive computer experience from small computers to massively parallel machines. Programming experience in a wide variety of computer languages.
This serial routine computes the QR decomposition of a matrix A in Remxn, m > = n, such that
where QT*Q = I in Remxm, R in Renxn upper triangular, and P_r in Remxm as well as P_c in Renxn are permutation matrices. Note that this is a research code developed for the following paper.
Thomas H. Robey and Deborah L. Sulsky, Row Ordering for Sparse QR Decomposition, SIAM J. Matrix Anal. and Appl., Vol. 15, No. 4, pp. 1208-1225, October 1994.
The software is available in C and C++. Version 1.3 is updated as of February 1998 and is available under the GNU Library General Public License. To obtain the source code click on the desired version listed below. Feedback on your experiences is welcomed.