.png){kind=icon}
Return
Communication-efficient parallel generic pairwise elimination
.png){kind=icon}
PRE
AI
DOI：10.1016/j.future.2006.04.017.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
parallel algorithms
algebraic algorithms
linear systems
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
F
IF:
6.1
Papers:
6.9K
Citations:
2.3W
Organization
No organization information available
Cited Papers
A new sparse Gaussian elimination algorithm and the Niederreiter linear system for trinomials over F2.png)
COMPUTING
COMPUTINGIF2.8
PREAI
ShareSaveCrystallographic Snapshots of Aspergillus fumigatus Phytase, Revealing Its Enzymatic DynamicsStructure
OAAI
StructureIF0
OAAIShareSaveElectrical resistance response of polyaniline films to water, ethanol, and nitric acid solution
PREAI
ShareSave
View more