๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

The theoretical cost of sequential and parallel algorithms for solving linear systems of equations

โœ Scribed by Salman H. Abbas

Publisher
Springer
Year
1996
Tongue
English
Weight
328 KB
Volume
17
Category
Article
ISSN
0253-4827

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Fast Parallel Algorithms for Solving Tri
Fast Parallel Algorithms for Solving Triangular Systems of Linear Equations on the Hypercube
โœ O.H. Ibarra; M.H. Kim ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 864 KB

This paper presents efficient hypercube algorithms for solving triangular systems of linear equations by using various matrix partitioning and mapping schemes. Recently, several parallel algorithms have been developed for this problem. In these algorithms, the triangular solver is treated as the sec

Parallel p-adic method for solving linea
Parallel p-adic method for solving linear systems of equations
โœ ร‡.K. Koรง ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 488 KB

We present a parallel algorithm for an exact solution of an integer linear system of equations using the single modulus p-adic expansion technique. More specifically, we parallelize an algorithm of Dixon, and present our implementation results on a distributed-memory multiprocessor. The parallel alg

Parallel Dichotomy Algorithm for solving
Parallel Dichotomy Algorithm for solving tridiagonal system of linear equations with multiple right-hand sides
โœ Andrew V. Terekhov ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 594 KB

A parallel algorithm for solving a series of matrix equations with a constant tridiagonal matrix and different right-hand sides is proposed and studied. The process of solving the problem is represented in two steps. The first preliminary step is calculating some rows of the inverse matrix of system