.png){kind=icon}
返回
Communication-efficient parallel generic pairwise elimination
.png){kind=icon}
PRE
AI
DOI：10.1016/j.future.2006.04.017.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The model of bulk-synchronous parallel (BSP) computation is an emerging paradigm of general-purpose parallel computing. In this paper, we consider the parallel complexity of generic pairwise elimination, special cases of which include Gaussian elimination with pairwise pivoting, Gaussian elimination over a finite field, generic Neville elimination and Givens reduction. We develop a new block-recursive, communication-efficient BSP algorithm for generic pairwise elimination. (c) 2006 Elsevier B.V. All rights reserved.
Keyword:
parallel algorithms
algebraic algorithms
linear systems
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
F
IF:
6.1
论文数:
6.9K
被引数:
2.3W
机构
暂无机构信息
引用论文
A new sparse Gaussian elimination algorithm and the Niederreiter linear system for trinomials over F2.png)
COMPUTING
COMPUTINGIF2.8
PREAI
分享收藏Crystallographic Snapshots of Aspergillus fumigatus Phytase, Revealing Its Enzymatic DynamicsStructure
OAAI
StructureIF0
OAAI分享收藏Electrical resistance response of polyaniline films to water, ethanol, and nitric acid solution
PREAI
分享收藏
查看更多内容