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

Authors:
A. P. Vazhenin
Affiliations:
-
Venue:
PAS '95 Proceedings of the First Aizu International Symposium on Parallel Algorithms/Architecture Synthesis
Year:
1995

Citing 8
Cited 0

Arbitrary accuracy with variable precision arithmetic

Proceedings of the International Symposium on interval mathematics on Interval mathematics 1985
Implementation and test of the ACRITH facility in a system/370

IEEE Transactions on Computers
Fortran-sc. a study of a fortran extension for engineering/scientific computation with access to acrith

Computing
Implementing Exact Calculations in Hardware

IEEE Transactions on Computers
Hardware speedups in long integer multiplication

ACM SIGARCH Computer Architecture News - Symposium on parallel algorithms and architectures
Towards a High Precision Massively Parallel Computer

PARLE '94 Proceedings of the 6th International PARLE Conference on Parallel Architectures and Languages Europe
Programmed word length computer

ACM '67 Proceedings of the 1967 22nd national conference
CADAC: A Controlled-Precision Decimal Arithmetic Unit

IEEE Transactions on Computers

Quantified Score

Hi-index	0.00

Visualization

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.