.png){kind=icon}
返回
Fast-forward/fast-backward substitutions on vector computers
.png){kind=icon}
PRE
AI
DOI：10.1109/59.801898.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper deals with approaches for sparse matrix substitutions using vector processing. Many publications have used the W-matrix method to solve the forward/backward substitutions on vector computer. Recently a different approach has been presented using dependency-based substitution algorithm (DBSA). In this paper the focus is on new algorithms able to explore the sparsity of the vectors. The efficiency is tested using linear systems from power systems with 118, 320, 725 and 1729 buses. The tests were performed on a CRAY Y MP2E/232. The speedups for a fast-forward/fast-backward using a 1729-bus system are near 19 and 14 for real and complex arithmetic operations, respectively. When forward/backward is employed the speedups are about 8 and 6 to perform the same simulations.
Keyword:
sparse linear systems
direct methods
sparse vector
vector processing
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.2
论文数:
1.1W
被引数:
5.0W
机构
暂无机构信息
引用论文
Multiply vulnerable populations: mobilising a politics of compassion from the ‘capacity to hurt’
OAAI
.png){kind=icon}
OAAI分享收藏Affective geopolitics: Anxiety, pain, and ethics in the encounter with Syrian refugees in Turkey
PREAI
分享收藏分享收藏分享收藏
查看更多内容