Parallel algorithm for solving systems of linear equations with dynamically changed length of operands

Author

Vazhenin, A.P.

Author_Institution

Comput. Center, Acad. of Sci., Novosibirsk, Russia

fYear

1995

fDate

15-17 Mar 1995

Firstpage

100

Lastpage

106

Abstract

Peculiarity of the most direct algorithms for solving system of linear equations is the use of divisions for the elimination of unknowns. Division requires great time for its execution, when the multiprecision arithmetic is used because in this case it is realized by special programs. In this paper a parallel algorithm is described implementing the elimination procedure without divisions. Some results are presented of execution time, speedup, and accuracy. Measurements were taken for a system supporting massively parallel high-accuracy SIMD-computations by dynamically changed length of operands

Keywords

linear algebra; mathematics computing; parallel algorithms; parallel programming; software performance evaluation; accuracy; direct algorithms; divisions; dynamically changed length of operands; elimination of unknowns; elimination procedure; execution time; linear equation solving; massively parallel high-accuracy SIMD-computations; multiprecision arithmetic; parallel algorithm; speedup; Concurrent computing; Data processing; Digital arithmetic; Dynamic programming; Equations; Length measurement; Parallel algorithms; Parallel programming; Roundoff errors; Supercomputers;

fLanguage

English

Publisher

ieee

Conference_Titel

Parallel Algorithms/Architecture Synthesis, 1995. Proceedings., First Aizu International Symposium on

Conference_Location

Fukushima

Print_ISBN

0-8186-7038-X

Type

conf

DOI

10.1109/AISPAS.1995.401349

Filename

401349