Optimal algorithms for parallel givens factorization on a coarse-grained PRAM

An analysis studies the complexity of the parallel Givens factorization of a square matrix of size n on a shared memory architecture composed with p identical processors (coarse grained EREW PRAM). The analysis deduces the time complexity and the minimum number of processors in order to compute the Givens factorization in asymptotically optimal time (2n + o(n)). These results complete previous analysis presented in the case where the number of processors is unlimited.