| 摘要 |
A method for Cholesky based processing of data includes receiving a first matrix that equals a product of a first lower triangular matrix and a first upper triangular matrix, where the first upper triangular matrix is a complex conjugate transpose of the first lower triangular matrix, and applying, by a processing unit that has a set of P processors, a loopless Cholesky factorization process on each equally sized block of multiple equally sized blocks of the first matrix to provide the first lower triangular matrix. Each equally sized block has E elements, where E is a integer multiple of P.
|
