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

A fast parallel algorithm for solving block-tridiagonal systems of linear equations including the domain decomposition method

โœ Scribed by Terekhov, Andrew V.

Book ID
120173668
Publisher
Elsevier Science
Year
2013
Tongue
English
Weight
836 KB
Volume
39
Category
Article
ISSN
0167-8191

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

Divide and conquer: a parallel algorithm
Divide and conquer: a parallel algorithm for the solution of a tridiagonal linear system of equations
โœ Stefan Bondeli ๐Ÿ“‚ Article ๐Ÿ“… 1991 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 655 KB

Bondeli, S\_, Divide and conquer: a parallel algorithm for the solution of a tridiagonal linear system of equations, Parallel Computing 17 (1991) 419-434\_ We describe a divide and conquer algorithm which solves linear tridiagonal systems with one right-hand side, especially suited for parallel com