Parallel Algorithms for Solving Large Sparse Linear Equations

DOI

10.2991/3ca-13.2013.40How to use a DOI?

Keywords

Large sparse linear equations; Block Lanczos; Block Wiedemann; Parallel Computing;

Abstract

To optimize the Block Widemann and Block Lancos algorithm is every important in solving large sparse systems in many engineering computing topic, so the parallel method of these two algorithms is built. This paper designs two different types of data parallel based on the original parallelism level and parallel scalability of two algorithms, and finally achieve a more efficient way for solving the problems. At last, we analysis the computing complexity and time cost, and gave a strategy for choosing the algorithms in different computing environment etc. based on the evaluation.

Copyright

© 2013, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Jingzhu Li
AU  - Peng Zou
AU  - Qingbo Wu
PY  - 2013/04
DA  - 2013/04
TI  - Parallel Algorithms for Solving Large Sparse Linear Equations
BT  - Proceedings of the 2nd International Symposium on Computer, Communication, Control and Automation
PB  - Atlantis Press
SP  - 157
EP  - 160
SN  - 1951-6851
UR  - https://doi.org/10.2991/3ca-13.2013.40
DO  - 10.2991/3ca-13.2013.40
ID  - Li2013/04
ER  -