Title: Parallel complexities and computations of cholesky's decomposition and QR factorization
Abstract: 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.
Publication Year: 1985
Publication Date: 1985-01-01
Language: en
Type: article
Indexed In: ['crossref']
Access and Citation
Cited By Count: 8
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot