Distributed orthogonal factorization
Distributed orthogonal factorization
复制标题
分布式正交因式分解
DOI：
--
复制
发表时间：
1989
期刊：
影响因子：
--
通讯作者：
P. Raghavan
中科院分区：
文献类型：
--
作者：
A. Pothen;P. Raghavan
描述了几种在分布式存储多处理机上计算正交因式分解的算法。其中一个算法是基于Givens旋转的，另外两个算法使用了Column Household变换，但采用了不同的通信方案：广播和流水线环路。第四种算法是一种混合算法；它在不同的阶段使用Househlold变换和Givens旋转。我们给出了每种算法的算术和通信复杂度的表达式。算法在IPSC-286上实现，观测时间与分析结果吻合较好。
We describe several algorithms for computing the orthogonal factorization on distributed memory multiprocessors. One of the algorithms is based on Givens rotations, two others employ column Householder transformations but with different communication schemes: broadcast and pipelined ring. A fourth algorithm is a hybrid; it uses Househlolder transformations and Givens rotations in separate phases. We present expressions for the arithmetic and communication complexity of each algorithm. The algorithms were implemented on an iPSC-286 and the observed times agree well with our analyses.