论文信息 - Stable parallel algorithms for computing and updating the QR decomposition

Stable parallel algorithms for computing and updating the QR decomposition

We propose new stable parallel algorithms based on Householder transformations and compound Given's rotations to compute the QR decomposition of a rectangular matrix. The predicted execution time of all algorithms on the massively parallel SIMD array processor AMT DAP 510, have been obtained and analyzed. Modified versions of these algorithms are also considered for updating the QR decomposition, when rows are inserted in the data matrix.<<ETX>>

E. J. Kontoghiorghes | M.R.B. Clarke

[1] Erricos John Kontoghiorghes,et al. Computing the Complete Orthogonal Decomposition Using a SIMD Array Processor , 1993, PARLE.

[2] D. Parkinson,et al. The AMT DAP 500 , 1988, Digest of Papers. COMPCON Spring 88 Thirty-Third IEEE Computer Society International Conference.

[3] Dennis Parkinson. The Distributed Array Processor (DAP) , 1983 .

[4] G. Golub,et al. Linear least squares solutions by householder transformations , 1965 .

[5] G. Stewart,et al. Reorthogonalization and stable algorithms for updating the Gram-Schmidt QR factorization , 1976 .