Parallel algorithm for solving systems of linear equations with dynamically changed length of operands
Parallel Algorithms / Architecture Synthesis, AIZU International Symposium on (1995)
Aizu-Wakamatsu, Fukushima, Japan
Mar. 15, 1995 to Mar. 17, 1995
A.P. Vazhenin , Comput. Center, Acad. of Sci., Novosibirsk, Russia
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.
linear algebra; parallel algorithms; parallel programming; mathematics computing; software performance evaluation; parallel algorithm; linear equation solving; dynamically changed length of operands; direct algorithms; divisions; elimination of unknowns; execution time; multiprecision arithmetic; elimination procedure; speedup; accuracy; massively parallel high-accuracy SIMD-computations
A.P. Vazhenin, "Parallel algorithm for solving systems of linear equations with dynamically changed length of operands", Parallel Algorithms / Architecture Synthesis, AIZU International Symposium on, vol. 00, no. , pp. 100, 1995, doi:10.1109/AISPAS.1995.401349