.png){kind=icon}
返回
A faster algorithm for solving linear algebraic equations on the star graph
.png){kind=icon}
PRE
AI
DOI：10.1016/S0743-7315(03)00031-5.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The problem of solving a linear system of equations is widely encountered in many fields of science and engineering. In this paper, we present a parallel algorithm to solve the above problem on a star graph. The proposed solution (i) is based on a variant of the Gaussian elimination algorithm (GE) called the successive Gaussian elimination algorithm (SGE) (IEE Proc. Comput. Digit. Tech. 143 (4) (1996)) and (ii) supports partial pivoting to provide numerical stability. We present efficient matrix distribution techniques on the star graph. Our proposed parallel algorithm employs these techniques to reduce communication overhead during matrix operations on the star graph. We estimate the performance of our parallel algorithm and demonstrate its effectiveness by comparing it with a recent algorithm for the same problem on star graphs (IEEE Trans. Parallel Distrib. Systems 8 (8) (1997) 803). (C) 2003 Elsevier Science (USA). All rights reserved.
Keyword:
linear system
matrix decomposition
Gaussian elimination
parallel algorithm
star graph
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4
论文数:
3.8K
被引数:
4.8K
机构
暂无机构信息
引用论文
Network Centrality of Resting-State fMRI in Primary Angle-Closure Glaucoma Before and After Surgery.png)
PLOS ONE
OAAI
PLOS ONEIF0
OAAI分享收藏
查看更多内容