Parallel complexities and computations of cholesky's decomposition and QR factorization
Karabi Datta · International Journal of Computer Mathematics · 1985
In this paper, it is shown that the parallel arithmetic computational complexities of the Cholesky's and QR factorization of a matrix are upper bounded by 0(log2 n) steps. Also, a new parallel method for QR factorization of a symmetric positive definite tridiagonal matrix is proposed. This method requires only 0(logn) steps using 0(n) processors.