Parallel iterative solution of systems of linear equations with dynamically changed length of operands
The paper deals with the development of parallel iterative algorithms for solving systems of linear equations in MIMD architecture. The problem is discussed taking into account factors, defining both the time and the accuracy of solution. The new parallel algorithm is described implementing the multistep refinement of results. The speedup is achieved using small operand length at early stages of solution. The results are presented of some numerical experiments executed in a multitransputer system.
Unable to display preview. Download preview PDF.
- 1.Buell, D., Ward, R.: A multiprecise integer arithmetic package. The Journal of Supercomputing. 3 No 2 (1989) 89–107Google Scholar
- 2.Vazhenin, A., Mirenkov, N.: SCORE: Scientific Computers for Overcoming Rounding Errors. PARALLEL COMPUTING: Trends and Applications. North-Holland (1994) 347–354Google Scholar
- 3.Aguliar, M.F., Duprat, J.: Towards a high precision massively parallel computer. Proc. of PARLE'94 Conference. Lect. Not. in Comp. Sci. Springer-Verlag. Berlin 817 (1994) 73–84Google Scholar
- 4.Vazhenin, A.P.: Efficient high-accuracy computations in massively parallel systems. Proc. of the Workshop on Parallel Scientific Computing (PARA'94-L). Lect. Not. in Comp. Sci. Berlin, Springer-Verlag 879 (1994) 505–519Google Scholar
- 5.Rice, J.R.: Matrix Computations and Mathematical Software. McGraw-Hill Book Company, New York (1981)Google Scholar
- 6.Fadeev, D.C., Fadeeva, V.N.: Computational Methods of Linear Algebra. FISMATGIS, Moscow, (1963)Google Scholar
- 7.Bakhvalov, N.S., Zhidkov, N.P., Kobelkov, G.M.: Numerical Methods. Nauka, Moscow, (1987)Google Scholar