By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
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

Published in:

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

Date of Conference:

15-17 Mar 1995