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

Parallel algorithms for sparse triangular system solution

โœ Scribed by P.Sreenivasa Kumar; M.Kishore Kumar; A Basu

Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
569 KB
Volume
19
Category
Article
ISSN
0167-8191

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Parallel algorithms for the solution of
Parallel algorithms for the solution of a sparse system
โœ Jenn-Ching Luo ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› Elsevier Science โš– 612 KB

This paper explores the effectiveness of the author's decomposition in a parallel environment. The author's decomposition is a new class of direct method, which factorizes a nonsingular matrix into triangular matrices such that the product of the obtained triangular matrices is the inverse of the or

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

Modular Algorithm for Sparse Multivariat
Modular Algorithm for Sparse Multivariate Polynomial Interpolationand its Parallel Implementation
โœ HIROKAZU MURAO; TETSURO FUJISE ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 885 KB

A new algorithm for sparse multivariate polynomial interpolation is presented. It is a multi-modular extension of the Ben-Or and Tiwari algorithm, and is designed to be a practical method to construct symbolic formulas from numeric data produced by vector or massively-parallel processors. The main i