Parallel QR decomposition of a rectangular matrix |
| |
Authors: | M Cosnard J -M Muller Y Robert |
| |
Institution: | (1) Laboratoire TIM3, Institut IMAG, CNRS, BP 68, F-38402 Saint Martin d'Heres Cedex, France |
| |
Abstract: | Summary We show that the greedy algorithm introduced in 1] and 5] to perform the parallel QR decomposition of a dense rectangular matrix of sizem×n is optimal. Then we assume thatm/n
2 tends to zero asm andn go to infinity, and prove that the complexity of such a decomposition is asymptotically2n, when an unlimited number of processors is available. |
| |
Keywords: | AMS (MOS): 65F05 CR: G1 3 |
本文献已被 SpringerLink 等数据库收录! |