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

Processor Efficient Parallel Solution of Linear Systems of Equations

โœ Scribed by Gilles Villard

Publisher
Elsevier Science
Year
2000
Tongue
English
Weight
65 KB
Volume
35
Category
Article
ISSN
0196-6774

No coin nor oath required. For personal study only.

โœฆ Synopsis

We present a deterministic parallel algorithm that solves a n-dimensional system Ax s b of linear equations over an ordered field or over a subfield of the complex ลฝ 2 . ลฝ ร„ ลฝ . 2 numbers. This algorithm uses O log n parallel time and O max M n , n ลฝ . 4 . ลฝ . log log n rlog n arithmetic processors if M n is the processor complexity of fast parallel matrix multiplication.

๐Ÿ“œ SIMILAR VOLUMES

On Rational Solutions of Systems of Line
On Rational Solutions of Systems of Linear Differential Equations
โœ Moulay A. Barkatou ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 403 KB

Let K be a field of characteristic zero and M(Y ) = N a system of linear differential equations with coefficients in K(x). We propose a new algorithm to compute the set of rational solutions of such a system. This algorithm does not require the use of cyclic vectors. It has been implemented in Maple

Conjugate gradient solution of linear eq
Conjugate gradient solution of linear equations
โœ BRINCH HANSEN, PER ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 142 KB ๐Ÿ‘ 1 views

The conjugate gradient method is an ingenious method for iterative solution of sparse linear equations. It is now a standard benchmark for parallel scientific computing. In the author's opinion, the apparent mystery of this method is largely due to the inadequate way in which it is presented in text